Visual field test assistance apparatus

ABSTRACT

A visual field test assistance apparatus infers a current visual field status at each test point. A predetermined mixture distribution is applied to a prior-distribution, and parameters regarding the predetermined mixture distribution are learned with reference to time-series information of visual field test results obtained in the past regarding a plurality of cases. The visual field test assistance apparatus calculates an inference test result vector representing an inference result of visual sensitivity to be obtained by the visual field test at each test point, by Bayesian inference, and performs an information output process on the basis of the inference test result vector obtained by the inference.

TECHNICAL FIELD

The present disclosure relates to a visual field test assistance apparatus which assists a visual field test of eyesight.

BACKGROUND ART

As a visual field test performed for diagnosing diseases such as glaucoma, etc., there is a known testing method of arranging a plurality of test points within an assumed visual field, lighting each of the test points at a designated luminance, and asking the patient as to whether or not he/she can see the light. Such a testing method may be the Humphrey visual field test.

In such a visual field test method, the processes of changing luminance and obtaining the patient's reactions thereto, must be performed at each of a large number of test points. Therefore, a great burden is imposed not only on the patient, but also on the testing personnel.

A technology for inferring the change of the visual field of a glaucoma patient is disclosed in Viswanathan A C, Fitzke F W, Hitchings R A. Early Detection of Visual Field Progression in Glaucoma: A Comparison of PROGRESSOR and Statpac2. Br J Ophthalmol 1997; 81(12): 1037-1042.

SUMMARY

As mentioned above, decreasing the burden in the visual field test has been desired. Specifically, a visual field test assistance apparatus capable of inferring the status of the current visual field at each test point has been desired.

The present disclosure has been made in view of the above, and one of the objectives of the present disclosure is to provide a visual field test assistance apparatus capable of estimating the status of the current visual field at each test point.

In order to solve the above drawbacks of the prior arts, the present disclosure provides apparatus which assists a visual field test testing visual sensitivity at each of a plurality of test points arranged within a previously assumed visual field range, the apparatus comprising, an acquisition device which acquires parameters regarding a predetermined mixture distribution, the parameters being learned with reference to time-series information of visual field test results obtained in the past regarding a plurality of cases using said mixture distribution for a prior-distribution, an inference calculation device which calculates an inference test result vector representing an inference result of visual sensitivity to be obtained by the visual field test at each test point, by Bayesian inference, by applying a mixture distribution using the acquired parameters to a prior-distribution, and an output device which performs an information output process on the basis of the inference test result vector obtained by the inference, wherein, during the visual field test, when a visual sensitivity is obtained regarding at least one test point by the time of an inference process, the inference calculation device performs a process of updating the prior-distribution by acquiring the visual sensitivity at the test point, and executing Bayesian inference regarding a partial inference test result vector representing an inference result of visual sensitivity at a test point at which no test result has been obtained at the time of the process, and the output device performs an information output process on the basis of the partial inference test result vector.

According to the present disclosure, an inference result of the current visual sensitivity can be obtained.

BRIEF EXPLANATION OF DRAWINGS

FIG. 1 is a block diagram showing a constitutional example of a visual field test assistance apparatus according to the present disclosure.

FIG. 2 is an explanatory view showing an example of arranging test points used in the process of a visual field test assistance apparatus according to the present disclosure.

EMBODIMENT

An embodiment of the present disclosure will be explained with reference to the drawings. A visual field test assistance apparatus 1 according to an embodiment of the present disclosure can be realized by a computer, and specifically, comprises a control unit 11, a storage unit 12, an operation unit 13, a display unit 14, and an input/output unit 15, as exemplified in FIG. 1.

Here, the control unit 11 is a program controlled device such as a CPU, etc., and operates in accordance with a program stored in the storage unit 12. According to the present embodiment, the control unit 11 executes a current visual field inference process assisting a visual field test testing visual sensitivity at each of a plurality of test points arranged within a previously assumed visual field range, and a future visual field inference process. In the current visual field inference process, a predetermined mixture distribution is employed as the prior-distribution, time-series information of visual field test results regarding a plurality of cases obtained in the past is referred to, and parameters regarding the applied mixture distribution is learned and stored. Then, the control unit 11 uses a mixture distribution using the learned parameters as a prior-distribution, performs Bayesian inference (specifically, inference by Bayesian linear regression) to calculate an inference test result vector expressing the inference results of visual sensitivities at the respective test points, i.e., the results assumed to be obtained through the visual field tests, and executes an information output process on the basis of the inference test result vector obtained through the Bayesian inference. The process will be described in detail later below.

Further, during the visual field test, when the visual sensitivity information obtained at a test point by the time of the inference process is input through the input/output unit 15, the control unit 11 updates the prior-distribution by the obtained partial visual sensitivity information, and performs inference by Bayesian linear regression to obtain a partial inference test result vector expressing the inference results of visual sensitivities at the test points at which the visual sensitivities have not been obtained at the time of the inference process. Then, the control unit 11 executes the information output process on the basis of the obtained partial inference test result vector.

The control unit 11 also performs a future visual field inference process which includes acquiring time-variable information of visual sensitivities at respective test points, and executing a regression analysis process regarding the acquired time-varied information of visual sensitivities at respective test points. Here, the control unit 11 counts the number of the test points at which the p value for the slope obtained by the regression analysis process is lower than a predetermined analysis threshold value, with respect each of the analysis threshold values, performs a binomial test regarding each of the counted numbers of the test points, and calculates binomial test p values which are the results of the binomial tests. The control unit 11 subjects the calculated binomial test p values to an averaging process, and calculates an averaged binomial test p value, determines presence or absence of a change in the visual sensitivity by referring to whether or not the averaged binomial test p value is lower than a predetermined binominal test threshold value, and outputs a result of the determination. The processes of the control unit 11 will also be described later below.

The storage unit 12 is a memory device, a disk device, etc., which holds a program to be executed by the control unit 11. The program may be provided by being stored in a computer-readable non-transitory medium, and copied to the storage unit 12. Further, the storage unit 12 stores information, such as a parameter value, which is necessary for the processes by the control unit 11. The storage unit 12 also functions as a work memory for the control unit 11.

The operation unit 13 includes a keyboard, a mouse, and the like. The operation unit 13 receives a user's instruction operation, and outputs the content of the instruction operation to the control unit 11. The display unit 14 is a display, a printer, and the like, which outputs information in accordance with the instruction input from the control unit 11.

The input/output unit 15 is a serial or parallel interface which performs data input/output. The input/output unit 15 receives information from an external apparatus, and outputs the received information to the control unit 11. Also, in accordance with instructions input from the control unit 11, the input/output unit 15 outputs information to an external apparatus.

Here, the current visual field inference process by the control unit 11 will be explained. In the following explanation, the current visual field inference result is modelled as a probability variable (random variable) which is shown in Formula (1) below, using the matrix Tm (m representing an identifier identifying an eye to be tested, and satisfying m=1, 2, . . . , M), the matrix Tm representing the result of the visual field test, and being a matrix of the number of test points Dt by the number of tests Nm.

$\begin{matrix} \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 1} \right\rbrack & \; \\ {{{P\left( {\left. T_{m} \middle| w_{m} \right.,\lambda_{m},L_{m}} \right)} = {\prod\limits_{n \in n_{m}}{\mathcal{N}\left( {\left. t_{n} \middle| {{\Phi\left( x_{n} \right)}w_{m}} \right.,{\lambda_{m}^{- 1}L_{m}^{- 1}}} \right)}}}{{\Phi\left( x_{n} \right)} = {\begin{pmatrix} 1 \\ x_{n} \end{pmatrix} \otimes I_{D_{t}}}}} & (1) \end{matrix}$ In Formula (1), wm is a vector with an intercept and a slope expressing the visual field progression, L represents a precision matrix (inverse matrix of a variance-covariance matrix), and λ represents a scalar value determining a degree of precision. The symbol of the encircled x represents a Kronecker product. N(.|.)  [Numerical Formula 2] represents a multivariate normal distribution. Further, xn represents time which has passed from the initial test, and IDt represents the identity matrix having dimensions of Dt×Dt.

Further, the vector wm with an intercept and a slope expressing the visual field progression is described by a mixture normal distribution represented by Formulae (2) and (3).

$\begin{matrix} \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 3} \right\rbrack & \; \\ {{P\left( {\left. w_{m} \middle| z_{m} \right.,\lambda_{m}} \right)} = {\prod\limits_{k = 1}^{K}\;\left\{ {\mathcal{N}\left( {\left. w_{m}||\mu_{k} \right.,{\lambda_{m}\Lambda_{k}}} \right)} \right\}^{z_{mk}}}} & (2) \\ {{P\left( z_{m} \right)} = {\prod\limits_{k = 1}^{K}\pi^{z_{m}k}}} & (3) \end{matrix}$ The precision matrix L is also described using a predetermined mixture distribution. For example, the precision matrix L can be described by a mixture of Wishart distributions as represented by Formulae (4) and (5).

$\begin{matrix} \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 4} \right\rbrack & \; \\ {{P\left( L_{m} \middle| \zeta_{m} \right)} = {\prod\limits_{h = 1}^{H}\;\left\{ {\mathcal{W}\left( {\left. L_{m} \middle| v_{h} \right.,W_{h}} \right)} \right\}^{\zeta_{mh}}}} & (4) \\ {{P\left( \zeta_{m} \right)} = {\prod\limits_{h = 1}^{H}\eta_{h}^{\zeta_{mh}}}} & (5) \end{matrix}$

The scalar value λ representing a degree of precision can be described by, for example, a mixture gamma distribution, as represented by Formulae (6) and (7).

$\begin{matrix} \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 5} \right\rbrack & \; \\ {{P(\lambda)} = {\prod\limits_{g = 1}^{G}\;\left\{ {\mathcal{G}\left( {\left. \lambda_{m} \middle| a_{g} \right.,b_{g}} \right)} \right\}^{\gamma_{m\; g}}}} & (6) \\ {{P\left( \gamma_{m} \right)} = {\prod\limits_{g = 1}^{G}\theta_{g}^{\gamma_{m\; g}}}} & (7) \end{matrix}$ In the above explanation,

$\begin{matrix} \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 6} \right\rbrack & \; \\ \begin{matrix} z_{mk} & \in & \left\{ {0,1} \right\} \\ {\sum\limits_{k = 1}^{K}\; z_{mk}} & = & 1 \\ \zeta_{mh} & \in & \left\{ {0,1} \right\} \\ {\sum\limits_{h = 1}^{H}\;\zeta_{mh}} & = & 1 \end{matrix} & \; \end{matrix}$ are satisfied.

Such mixture distributions are applied, taking into account the experimental knowledge that visual field loss does not always occur at one location, but may occur at a plurality of locations.

Based on the above, likelihood including latent variables, i.e., P(T,w,λ,L,ζ,z,γ)  [Numerical Formula 7] is described as the product of a sequence of the products of these mixture distributions, the number of the products in the sequence being the number of eyes, specifically, as represented by Formula (*).

$\begin{matrix} \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 8} \right\rbrack & \; \\ \begin{matrix} {{P\left( {T,w,\lambda,L,\zeta,z,\gamma} \right)} = {\prod\limits_{m = 1}^{M}\;{P\left( {\left. T_{m} \middle| w_{m} \right.,\ \lambda_{m},\ L_{m}} \right)}}} \\ {\prod\limits_{m = 1}^{M}{{P\left( L_{m} \middle| \zeta_{m} \right)}{\prod\limits_{m = 1}^{M}{P\left( \zeta_{m} \right)}}}} \\ {\prod\limits_{m = 1}^{M}{{P\left( {\left. w_{m} \middle| z_{m} \right.,\lambda_{m}} \right)}{\prod\limits_{m = 1}^{M}{P\left( z_{m} \right)}}}} \\ {\prod\limits_{m = 1}^{M}{{P\left( \lambda_{m} \right)}{\prod\limits_{m = 1}^{M}{P\left( \gamma_{m} \right)}}}} \end{matrix} & \left. {(*} \right) \end{matrix}$

Prior to the current visual field test result inference process, the control unit 11 uses a formula obtained by assigning Formulae (1) to (6) to Formula (*), to infer the following parameters (hyperparameters). v,W,μ,Λ,a,b,π,θ,η  [Numerical Formula 9] Specifically, the EM Algorithm can be used for this inference for parameters.

When using the EM Algorithm, calculating P(w,λ,L,z,ζ,γ|T)  [Numerical Formula 10] in E-step (step for calculating an expectation value for the likelihood) is difficult. The expectation value may be calculated by applying the mean field approximation as below. P(w,λ,L,z,ζ,z,γ|T)=q(w)q(λ)q(L)q(ζ)q(z)q(γ)  [Numerical Formula 11]

The optimal posterior distribution in the mean field approximation is represented by applying an asterisk (*) as upper index of each symbol. Nm represents the number of tests regarding the eye m, and Dw represents the dimension of the vector μm.

Thus, each optimal posterior distribution is represented as below. q*(w _(m))=N(w _(m)|{circumflex over (μ)}_(m),{circumflex over (Λ)}_(m) ⁻¹)  [Numerical Formula 12] wherein,

$\begin{matrix} {\left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 13} \right\rbrack\mspace{79mu}{{\overset{\hat{}}{\Lambda}}_{m} = {\left\langle {\lambda m} \right\rangle\left\{ {{\sum\limits_{n \in n_{m}}{{\Phi\left( x_{n} \right)}\left\langle L_{m} \right\rangle{\Phi\left( x_{n} \right)}^{T}}} + {\sum\limits_{k = 1}^{K}{\left\langle z_{mk} \right\rangle\Lambda_{k}}}} \right\}}}{{\overset{\hat{}}{\mu}}_{m} = {\left\{ {{\sum\limits_{n \in n_{m}}{{\Phi\left( x_{n} \right)}\left\langle L_{m} \right\rangle{\Phi\left( x_{n} \right)}^{T}}} + {\sum\limits_{k = 1}^{K}{\left\langle z_{mk} \right\rangle\Lambda_{k}}}} \right\}^{- 1}\left\{ {{\sum\limits_{n \in n_{m}}{{\Phi\left( x_{n} \right)}\left\langle L_{m} \right\rangle t_{n}}} + {\sum\limits_{k = 1}^{K}{\left\langle z_{mk} \right\rangle\Lambda_{k}\mu_{k}}}} \right\}}}} & \; \end{matrix}$ wherein Φ satisfies the equation shown with Formula (1). q*(λ_(m))=G(λ_(m) |â _(m) ,{circumflex over (b)} _(m))  [Numerical Formula 14] wherein,

[Numerical  Formula  15] ${\overset{\hat{}}{a}}_{m} = {\frac{N_{m}D_{t}}{2} + \frac{D_{w}}{2} + {\sum\limits_{g = 1}^{G}{\left\langle \gamma_{mg} \right\rangle a_{g}}}}$ $\begin{matrix} {{\hat{b}}_{m} = {{\sum\limits_{g = 1}^{G}{\left\langle \gamma_{mg} \right\rangle b_{g}}} + {\frac{1}{2}{\sum\limits_{n \in n_{m}}{\left( {t_{n} - {{\Phi\left( x_{n} \right)}^{T}{\overset{\hat{}}{\mu}}_{m}}} \right)^{T}\left\langle L_{m} \right\rangle\left( {t_{n} - {{\Phi\left( x_{n} \right)}^{T}{\overset{\hat{}}{\mu}}_{m}}} \right)}}}}} \\ {{+ \frac{1}{2}}{\sum\limits_{n \in n_{m}}{{Trace}\left( {{\overset{\hat{}}{\Lambda}}_{m}^{- 1}{\Phi\left( x_{n} \right)}\left\langle L_{m} \right\rangle{\Phi\left( x_{n} \right)}^{T}} \right)}}} \\ {{+ \frac{1}{2}}{\sum\limits_{k = 1}^{K}{\left\langle z_{mk} \right\rangle\left( {{\overset{\hat{}}{\mu}}_{m} - \mu_{k}} \right)^{T}{\Lambda_{k}\left( {{\overset{\hat{}}{\mu}}_{m} - \mu_{k}} \right)}}}} \\ {{+ \frac{1}{2}}{\sum\limits_{k = 1}^{K}{\left\langle z_{mk} \right\rangle{{Trace}\left( {{\overset{\hat{}}{\Lambda}}_{m}^{- 1}\Lambda_{k}} \right)}}}} \end{matrix}$ q*(L _(m))=W(L _(m) |{circumflex over (v)} _(m) ,Ŵ _(m))  [Numerical Formula 16]

wherein,

$\begin{matrix} \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 17} \right\rbrack & \; \\ {\mspace{79mu}{{{\hat{v}}_{m} = {{\sum\limits_{h = 1}^{H}\;{\left\langle \zeta_{mh} \right\rangle v_{h}}} + N_{m}}}{{\hat{w}}_{m}^{- 1} = {{\sum\limits_{h = 1}^{H}\;{\left\langle \zeta_{mh} \right\rangle W_{h}^{- 1}}} + {\sum\limits_{n \in n_{m}}\;{\left\langle \lambda_{m} \right\rangle\left( {t_{n} - {{\Phi\left( x_{n} \right)}^{T}{\hat{\mu}}_{m}}} \right)\left( {t_{n} - {{\Phi\left( x_{n} \right)}^{T}{\hat{\mu}}_{m}}} \right)^{T}}} + {\sum\limits_{n \in n_{m}}\;{\left\langle \lambda_{m} \right\rangle{\Phi\left( x_{n} \right)}^{T}{\hat{\Lambda}}_{m}^{- 1}{\Phi\left( x_{n} \right)}}}}}}} & \; \\ {\left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 18} \right\rbrack\mspace{79mu}{{q*\left( z_{m} \right)} = {\prod\limits_{k = 1}^{K}\; r_{mk}^{z_{mk}}}}} & \; \end{matrix}$ wherein,

$\begin{matrix} {\left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 19} \right\rbrack{{\ln\; r_{mk}} = {{{\frac{1}{2}\ln{\Lambda_{k}}} - {\frac{1}{2}\left\langle \lambda_{m} \right\rangle\left( {{\overset{\hat{}}{\mu}}_{m} - \mu_{k}} \right)^{T}{\Lambda_{k}\left( {{\hat{\mu}}_{m} - \mu_{k}} \right)}} - {\frac{1}{2}\left\langle \lambda_{m} \right\rangle{{Trace}\left( {{\overset{\hat{}}{\Lambda}}_{m}^{- 1}\Lambda_{k}} \right)}} + {\ln\pi_{k}} + {{const}{\sum\limits_{k = 1}^{K}r_{mk}}}} = 1}}} & \mspace{11mu} \\ {\left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 20} \right\rbrack\mspace{85mu}{{q*\left( \zeta_{m} \right)} = {\prod\limits_{h = 1}^{H}\;\rho_{mh}^{\zeta_{mh}}}}} & \; \end{matrix}$ wherein,

$\begin{matrix} {\left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 21} \right\rbrack{{\ln\;\rho_{mh}} = {{{{- \frac{1}{2}}\nu_{h}\ln{W_{h}}} - {\frac{1}{2}\nu_{h}D_{t}\ln\; 2\frac{D_{t}\left( {D_{t} - 1} \right)}{4}\ln\pi} - {\sum\limits_{i = 1}^{D_{t}}{\ln{\Gamma\left( \frac{\nu_{h} + 1 - i}{2} \right)}}} + {\frac{\nu_{h} - D_{t} - 1}{2}\left\langle {\ln{L_{m}}} \right\rangle} - {\frac{1}{2}{{Trace}\left( {W_{h}^{- 1}\left\langle L_{m} \right\rangle} \right)}} + {\ln\eta_{h}} + {{const}{\sum\limits_{h = 1}^{H}\rho_{mh}}}} = 1}}} & \mspace{11mu} \\ {\left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 22} \right\rbrack\mspace{79mu}{{q*\left( \gamma_{m} \right)} = {\underset{g = 1}{\prod\limits^{G}}s_{mg}^{\gamma_{mg}}}}} & \; \end{matrix}$ wherein,

$\begin{matrix} {\left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 23} \right\rbrack{{\ln\; s_{mg}} = {{{{- \ln}\;{\Gamma\left( a_{g} \right)}} + {a_{g}\ln b_{g}} + {\left( {a_{g} - 1} \right)\left\langle {\ln\lambda_{m}} \right\rangle} - {b_{g}\left\langle \lambda_{m} \right\rangle} + {\ln\;\theta_{g}} + {{const}{\underset{g = 1}{\sum\limits^{G}}s_{mg}}}} = 1}}} & \mspace{11mu} \end{matrix}$ Here, the following equations are satisfied.

$\begin{matrix} {\left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 24} \right\rbrack{\left\langle \lambda_{m} \right\rangle = \frac{{\hat{a}}_{m}}{{\hat{b}}_{m}}}{\left\langle {\ln\lambda_{m}} \right\rangle = {{\psi\left( {\hat{a}}_{m} \right)} - {\ln{\overset{\hat{}}{b}}_{m}}}}{\left\langle L_{m} \right\rangle = {{\overset{\hat{}}{\nu}}_{m}{\overset{\hat{}}{W}}_{m}}}{\left\langle {\ln L_{m}} \right\rangle = {{\sum\limits_{i = 1}^{D_{t}}{\psi\left( \frac{{\hat{\nu}}_{m} + 1 - i}{2} \right)}} + {D_{t}\ln 2} + {\ln{{\overset{\hat{}}{W}}_{m}}}}}} & \mspace{11mu} \end{matrix}$ <z _(mk) >=r _(mk) <ζ_(mh)>=ρ_(mh) <γ_(mg) >=s _(mg)

Further, in the M-step (maximization step), hyperparameter re-estimating equations with respect to W,μ,Λ,b,π,θ,η  [Numerical Formula 25] are as follows.

$\begin{matrix} {\mspace{79mu}\left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 26} \right\rbrack} & \; \\ {\mspace{79mu}{{\mu_{k}^{new} = \frac{\sum\limits_{m = 1}^{M}\;{\left\langle z_{mk} \right\rangle\left\langle \lambda_{m} \right\rangle{\hat{\mu}}_{m}}}{\sum\limits_{m = 1}^{M}\;{\left\langle z_{mk} \right\rangle\left\langle \lambda_{m} \right\rangle}}}{\Lambda_{k}^{new} = {\left\{ {{\sum\limits_{m = 1}^{M}{\left\langle z_{mk} \right\rangle\left\langle \lambda_{m} \right\rangle\left( {{\hat{\mu}}_{m} - \mu_{k}} \right)\left( {{\hat{\mu}}_{m} - \mu_{k}} \right)^{T}}} + {\sum\limits_{m = 1}^{M}{\left\langle z_{mk} \right\rangle\left\langle \lambda_{m} \right\rangle{\hat{\Lambda}}_{m}^{- 1}}}} \right\}^{- 1}\left( {\sum\limits_{m = 1}^{M}\left\langle z_{mk} \right\rangle} \right)}}}} & (1.34) \\ {\mspace{79mu}{W_{h}^{new} = \frac{\sum\limits_{m = 1}^{M}{\left\langle \zeta_{mh} \right\rangle\left\langle L_{m} \right\rangle}}{v_{h}{\sum\limits_{m = 1}^{M}\left\langle \zeta_{mh} \right\rangle}}}} & (1.36) \\ {\mspace{79mu}{b_{g}^{new} = \frac{a_{g}{\sum\limits_{m = 1}^{M}\left\langle \gamma_{m\; g} \right\rangle}}{\sum\limits_{m = 1}^{M}{\left\langle \gamma_{m\; g} \right\rangle\left\langle \lambda_{m} \right\rangle}}}} & (1.37) \\ {\mspace{79mu}{\pi_{k}^{new} = \frac{\sum\limits_{m = 1}^{M}\left\langle z_{mk} \right\rangle}{M}}} & (1.38) \\ {\mspace{79mu}{\eta_{h}^{new} = \frac{\sum\limits_{m = 1}^{M}\left\langle \zeta_{mh} \right\rangle}{M}}} & (1.39) \\ {\mspace{79mu}{\theta_{g}^{new} = \frac{\sum\limits_{m = 1}^{M}\left\langle \gamma_{m\; g} \right\rangle}{M}}} & (1.40) \end{matrix}$ With respect to νh, the solution of the following equation is determined as new νh.

  [Numerical  Formula  27] ${{\ln{{\sum\limits_{m = 1}^{M}{\left\langle \zeta_{mh} \right\rangle\left\langle L_{m} \right\rangle}}}} - {D_{t}\ln\; v_{h}} - {D_{t}{\ln\left( {\sum\limits_{m = 1}^{M}\left\langle \zeta_{mh} \right\rangle} \right)}} + {D_{t}\ln\; 2} + {\sum\limits_{i = 1}^{D_{t}}\;{\psi\left( \frac{v_{h} + 1 - i}{2} \right)}} - \frac{\sum\limits_{m = 1}^{M}{\left\langle \zeta_{mh} \right\rangle\left\langle {\ln{L_{m}}} \right\rangle}}{\sum\limits_{m = 1}^{M}\left\langle \zeta_{mh} \right\rangle}} = 0$ The new νh is described as ν_(h) ^(new) With respect to a, the solution of the following equation is determined as new a.

$\mspace{20mu}{{\left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 29} \right\rbrack - {\psi\left( a_{g} \right)} + {\ln\; a_{g}} + {\ln\left( {\sum\limits_{m = 1}^{M}\left\langle \gamma_{m\; g} \right\rangle} \right)} - {\ln\left( {\sum\limits_{m = 1}^{M}{\left\langle \gamma_{m\; g} \right\rangle\left\langle L_{m} \right\rangle}} \right)} + \frac{\sum\limits_{m = 1}^{M}{\left\langle \gamma_{m\; g} \right\rangle\left\langle {\ln\;\lambda_{m}} \right\rangle}}{\sum\limits_{m = 1}^{M}\left\langle \gamma_{m\; g} \right\rangle}} = 0}$ The new a is described as a _(g) ^(new)  [Numerical Formula 30] In the above equation, ψ(.) represents a digamma function.

As an example, the control unit 11 alternately executes the above E-step and the M-step, and calculates the optimal hyperparameters. The lower bound of the likelihood P(T) can be calculated as below.

$\begin{matrix} {\left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 31} \right\rbrack{\mathcal{L}\mathcal{B}} = {{\sum\limits_{m = 1}^{M}{\sum\limits_{n \in n_{m}}{{\mathbb{E}}\left\lbrack {\ln\;{\mathcal{N}\left( {\left. t_{n} \middle| {{\Phi\left( x_{n} \right)}w_{m}} \right.,{\lambda_{m}^{- 1}L_{m}^{- 1}}} \right)}} \right\rbrack}}} + {\sum\limits_{m = 1}^{M}{\sum\limits_{h = 1}^{H}{{\mathbb{E}}\left\lbrack {\zeta_{mh}\ln\;{\mathcal{W}\left( {{L_{m}❘\nu_{h}},W_{h}} \right)}} \right\rbrack}}} + {\sum\limits_{m = 1}^{M}{\sum\limits_{h = 1}^{H}{{\mathbb{E}}\left\lbrack {\zeta_{mh}\ln\;\eta_{h}} \right\rbrack}}} + {\sum\limits_{m = 1}^{M}{\sum\limits_{k = 1}^{K}{{\mathbb{E}}\left\lbrack {z_{mk}\ln\;{\mathcal{N}\left( {{w_{m}❘\mu_{k}},\ {\lambda_{m}^{- 1}\Lambda_{k}^{- 1}}} \right)}} \right\rbrack}}} + {\sum\limits_{m = 1}^{M}{\sum\limits_{k = 1}^{K}{{\mathbb{E}}\left\lbrack {z_{mk}\ln\pi_{k}} \right\rbrack}}} + {\sum\limits_{m = 1}^{M}{\sum\limits_{g = 1}^{G}{{\mathbb{E}}\left\lbrack {\gamma_{mg}\ln\;{\mathcal{G}\left( {\left. \lambda_{m} \middle| a_{g} \right.,b_{g}} \right)}} \right\rbrack}}} + {\sum\limits_{m = 1}^{M}{\sum\limits_{g = 1}^{G}{{\mathbb{E}}\left\lbrack {\gamma_{mg}\ln\theta_{g}} \right\rbrack}}} + {- {\sum\limits_{m = 1}^{M}{{\mathbb{E}}\left\lbrack {\ln\;{\mathcal{N}\left( {\left. w_{m} \middle| {\overset{\hat{}}{\mu}}_{m} \right.,{\overset{\hat{}}{\Lambda}}_{m}^{- 1}} \right)}} \right\rbrack}}} + {- {\sum\limits_{m - 1}^{M}{{\mathbb{E}}\left\lbrack {\ln\;{\mathcal{G}\left( {\left. \lambda_{m} \middle| {\overset{\hat{}}{a}}_{m} \right.,{\overset{\hat{}}{b}}_{m}} \right)}} \right\rbrack}}} + {- {\sum\limits_{m = 1}^{M}{{\mathbb{E}}\left\lbrack {\ln\;{\mathcal{W}\left( {{L_{m}❘{\hat{v}}_{m}},{\overset{\hat{}}{W}}_{m}} \right)}} \right\rbrack}}} + {- {\sum\limits_{m = 1}^{M}{\sum\limits_{k = 1}^{K}{r_{mk}\ln\mspace{11mu} r_{mk}}}}} + {- {\sum\limits_{m = 1}^{M}{\sum\limits_{h = 1}^{H}{\rho_{mh}\ln\;\rho_{nh}}}}} + {- {\sum\limits_{m = 1}^{M}{\sum\limits_{g = 1}^{G}{s_{mg}\ln\; s_{mg}}}}}}} & \mspace{11mu} \end{matrix}$ wherein,

$\begin{matrix} \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 132} \right\rbrack & \; \\ {\sum\limits_{m = 1}^{M}\;{\sum\limits_{n \in n_{m}}\;{{\mathbb{E}}\left\lbrack {{\ln\mspace{14mu}{\mathcal{N}\left( {t_{n}\left. {{{\Phi\left( x_{n} \right)}w_{m}},\lambda_{m}^{- 1},L_{m}^{- 1}} \right)} \right\rbrack}} = {{{- \frac{{ND}_{t}}{2}}\ln\mspace{11mu} 2\pi} + {\sum\limits_{m = 1}^{M}\;\left( {{\frac{N_{m}D_{t}}{2}\left\langle {\ln\mspace{11mu}\lambda_{m}} \right\rangle} + {\frac{N_{m}}{2}\left\langle {\ln{L_{m}}} \right\rangle}} \right)} + {{- \frac{1}{2}}{\sum\limits_{m = 1}^{M}\;{\sum\limits_{n \in n_{m}}\;{\left\langle \lambda_{m} \right\rangle\left( {t_{n} - {{\Phi\left( x_{n} \right)}^{T}{\hat{\mu}}_{m}}} \right)^{T}\left\langle L_{m} \right\rangle\left( {t_{n} - {{\Phi\left( x_{n} \right)}^{T}{\hat{\mu}}_{m}}} \right)}}}} + {{- \frac{1}{2}}{\sum\limits_{m = 1}^{M}\;{\sum\limits_{n \in n_{m}}\;{\left\langle \lambda_{m} \right\rangle{{Trace}\left( {{\hat{\Lambda}}_{m}^{- 1}{\Phi\left( x_{n} \right)}\left\langle L_{m} \right\rangle{\Phi\left( x_{n} \right)}^{T}} \right)}}}}}}} \right.}}} & \; \end{matrix}$

$\begin{matrix} \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 33} \right\rbrack & \; \\ {{\sum\limits_{m = 1}^{M}\;{\sum\limits_{h = 1}^{H}\;{{\mathbb{E}}\left\lbrack {\zeta_{mh}\mspace{11mu}\ln\mspace{11mu}{\mathcal{W}\left( {{L_{m}❘v_{h}},W_{h}} \right)}} \right\rbrack}}} = {{\sum\limits_{h = 1}^{H}\;\left\{ {\left( {\sum\limits_{m = 1}^{M}\;\left\langle \zeta_{mh} \right\rangle} \right)\left( {{{- \frac{v_{h}}{2}}\ln{W_{h}}} - {\frac{v_{h}D_{t}}{2}\ln\mspace{11mu} 2} - {\sum\limits_{t = 1}^{D_{t}}\;{\ln\;{\Gamma\left( \frac{v_{h} + 1 - i}{2} \right)}}}} \right)} \right\}} + {{- \frac{{MD}_{t}\left( {D_{t} - 1} \right)}{4}}\ln\mspace{11mu}\pi} - {\frac{D_{t} + 1}{2}{\sum\limits_{m = 1}^{M}\;\left\langle {\ln{L_{m}}} \right\rangle}} + {\sum\limits_{h = 1}^{H}\;\left\{ {\frac{v_{h}}{2}{\sum\limits_{m = 1}^{M}\;{\left\langle \zeta_{mn} \right\rangle\left\langle {\ln{L_{m}}} \right\rangle}}} \right\}} - {\frac{1}{2}{\sum\limits_{h = 1}^{H}\;{{Trace}\left( {W_{h}^{- 1}{\sum\limits_{m = 1}^{M}\;{\left\langle \zeta_{mh} \right\rangle\left\langle L_{m} \right\rangle}}} \right)}}}}} & \; \end{matrix}$

$\begin{matrix} \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 34} \right\rbrack & \; \\ {{\sum\limits_{m = 1}^{M}\;{\sum\limits_{h = 1}^{H}\;{{\mathbb{E}}\left\lbrack {\zeta_{mh}\mspace{11mu}\ln\mspace{11mu}\eta_{h}} \right\rbrack}}} = {\sum\limits_{h = 1}^{H}\;\left\{ {\left( {\sum\limits_{m = 1}^{M}\;\rho_{mh}} \right)\ln\mspace{11mu}\eta_{h}} \right\}}} & \; \end{matrix}$

$\begin{matrix} \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 35} \right\rbrack & \; \\ {{\sum\limits_{m = 1}^{M}\;{\sum\limits_{k = 1}^{K}\;{{\mathbb{E}}\left\lbrack {z_{mk}\ln\mspace{11mu}{\mathcal{N}\left( {{w_{m}❘\mu_{k}},{\lambda_{m}^{- 1}\Lambda_{k}^{- 1}}} \right)}} \right\rbrack}}} = {{{- \frac{{MD}_{w}}{2}}\ln\mspace{11mu} 2\pi} + {\frac{D_{w}}{2}{\sum\limits_{m = 1}^{M}\;\left\langle {\ln\mspace{11mu}\lambda_{m}} \right\rangle}} + {\frac{1}{2}{\sum\limits_{k = 1}^{K}\;\left\{ {\left( {\sum\limits_{m = 1}^{M}\;\left\langle z_{mk} \right\rangle} \right)\ln{\Lambda_{k}}} \right\}}} + {{- \frac{1}{2}}{\sum\limits_{m = 1}^{M}\;{\sum\limits_{k = 1}^{K}\;{\left\langle \lambda_{m} \right\rangle\left\langle z_{mk} \right\rangle\left( {{\hat{\mu}}_{m} - \mu_{k}} \right)^{T}{\Lambda_{k}\left( {{\hat{\mu}}_{m} - \mu_{k}} \right)}}}}} + {{- \frac{1}{2}}{\sum\limits_{k = 1}^{K}\;{{Trace}\left( {\Lambda_{k}{\sum\limits_{m = 1}^{M}\;{\left\langle z_{mk} \right\rangle\left\langle \lambda_{m} \right\rangle{\hat{\Lambda}}_{m}^{- 1}}}} \right)}}}}} & \; \end{matrix}$

$\begin{matrix} \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 36} \right\rbrack & \; \\ {{\sum\limits_{m = 1}^{M}\;{\sum\limits_{k = 1}^{K}\;{{\mathbb{E}}\left\lbrack {z_{mk}\ln\mspace{11mu}\pi_{k}} \right\rbrack}}} = {\sum\limits_{k = 1}^{K}\;\left\{ {\left( {\sum\limits_{m = 1}^{M}\; r_{mk}} \right)\mspace{11mu}\ln\mspace{11mu}\pi_{k}} \right\}}} & \; \\ \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 37} \right\rbrack & \; \\ {{\sum\limits_{m = 1}^{M}\;{\sum\limits_{g = 1}^{G}\;{{\mathbb{E}}\left\lbrack {\gamma_{mg}\;\ln\mspace{11mu}{\mathcal{G}\left( {{\lambda_{m}❘a_{g}},b_{g}} \right)}} \right\rbrack}}} = {\sum\limits_{g = 1}^{G}\;\left\{ {{\left( {\sum\limits_{m = 1}^{M}\;\left\langle \gamma_{mg} \right\rangle} \right)\left( {{{- \ln}\mspace{11mu}{\Gamma\left( a_{g} \right)}} + {a_{g}\mspace{11mu}\ln\mspace{11mu} b_{g}}} \right)} + {\left( {a_{g} - 1} \right){\sum\limits_{m = 1}^{M}\;{\left\langle \gamma_{mg} \right\rangle\left\langle {\ln\mspace{11mu}\lambda_{m}} \right\rangle}}} - {b_{g}{\sum\limits_{m = 1}^{M}\;{\left\langle \gamma_{mg} \right\rangle\left\langle \lambda_{m} \right\rangle}}}} \right\}}} & \; \end{matrix}$

$\begin{matrix} \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 38} \right\rbrack & \; \\ {{{\sum\limits_{m = 1}^{M}\;{\sum\limits_{g = 1}^{G}\;{{\mathbb{E}}\left\lbrack {\gamma_{mg}\mspace{11mu}\ln\mspace{11mu}\theta_{g}} \right\rbrack}}} = {\sum\limits_{g = 1}^{G}\;\left\{ {\ln\mspace{11mu}\theta_{g}{\sum\limits_{g = 1}^{G}\; s_{mg}}} \right\}}},{{- {\sum\limits_{m = 1}^{M}\;{{\mathbb{E}}\left\lbrack {\ln\mspace{11mu}{\mathcal{N}\left( {{w_{m}❘{\hat{\mu}}_{m}},{\hat{\Lambda}}_{m}^{- 1}} \right)}} \right\rbrack}}} = {{{- \frac{{MD}_{w}}{2}}\ln\mspace{11mu} 2\pi} + {\frac{1}{2}{\sum\limits_{m = 1}^{M}\;{\ln{{\hat{\Lambda}}_{m}}}}} - \frac{{MD}_{w}}{2}}},{{- {\sum\limits_{m = 1}^{M}\;{{\mathbb{E}}\left\lbrack {\ln\mspace{11mu}{\mathcal{G}\left( {{\lambda_{m}❘{\hat{a}}_{m}},{\hat{b}}_{m}} \right)}} \right\rbrack}}} = {\sum\limits_{m = 1}^{M}\;\left\{ {{{- \ln}\mspace{11mu}{\Gamma\left( {\hat{a}}_{m} \right)}} + {\left( {{\hat{a}}_{m} - 1} \right){\psi\left( {\hat{a}}_{m} \right)}} + {\ln\mspace{11mu}{\hat{b}}_{m}} - {\hat{a}}_{m}} \right\}}},{{- {\sum\limits_{m = 1}^{M}\;{{\mathbb{E}}\left\lbrack {\ln\mspace{11mu}{\mathcal{W}\left( {{L_{m}❘{\hat{v}}_{m}},{\hat{W}}_{m}} \right)}} \right\rbrack}}} = {{\sum\limits_{m = 1}^{M}\;\left\{ {{{- \frac{{\hat{v}}_{m}}{2}}\ln{{\hat{W}}_{n}}} - {\frac{D_{t}{\hat{v}}_{m}}{2}\ln\mspace{11mu} 2} - {\sum\limits_{i = 1}^{D_{t}}\;{\ln\mspace{11mu}{\Gamma\left( \frac{{\hat{v}}_{m} + 1 - i}{2} \right)}\frac{{\hat{v}}_{m} - D_{t} - 1}{2}\left\langle {\ln{L_{m}}} \right\rangle}} - \frac{D_{t}{\hat{v}}_{m}}{2}} \right\}} - {\frac{{MD}_{t}\left( {D_{t} - 1} \right)}{4}\ln\mspace{11mu}\pi}}}} & \; \end{matrix}$ The control unit 11 stores the optimal hyperparameter values calculated from above, in the storage unit 12.

In response to the instruction, from the operation unit 13, to infer the result of the current visual field test, the control unit 11 executes the following inference process. The inference process is different between (1) the inference process for a patient who has undergone the visual field test for N times before, and (2) the inference process for a patient who undergoes the visual field test for the first time. Therefore, these cases are described separately. The control unit 11 receives instructions indicating the case (1) or the case (2), and executes ether of the following processes.

[For a Patient Who has Undergone the Visual Field Test for N Times Before]

In case of a patient who has undergone the visual field test for N times before, the control unit 11 executes Bayesian inference calculation, provided that the inference test result vector tN+1 indicates an inference result of visual sensitivity at each test point in the current visual field test, that each of the test result vectors t1, t2, . . . , tN indicates each of the past N-time actual measurement results of the visual sensitivity at the each test point, and that the full likelihood of the inference test result vector tN+1 is represented as below.

$\begin{matrix} {\mspace{79mu}\left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 41} \right\rbrack} & \; \\ {\mspace{79mu}{{q^{*}\left( {t_{N + 1}❘w} \right)} = {\mathcal{N}\left( {{t_{N + 1}❘{{\Phi\left( x_{N + 1} \right)}^{T}w}},{\left\langle \lambda \right\rangle^{- 1}\left\langle L \right\rangle^{- 1}}} \right)}}} & (8) \\ {\mspace{79mu}\left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 42} \right\rbrack} & \; \\ {\mspace{79mu}{{{q^{*}(w)} = {\mathcal{N}\left( {{w❘\hat{\mu}},{\hat{\Lambda}}^{- 1}} \right)}}\mspace{79mu}{{wherein},}}} & (9) \\ {\mspace{79mu}\left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 43} \right\rbrack} & \; \\ {\mspace{79mu}{{\hat{\Lambda} = {\left\langle \lambda \right\rangle\left\{ {{\sum\limits_{n = 1}^{N}{{\Phi\left( x_{n} \right)}\left\langle L \right\rangle{\Phi\left( x_{n} \right)}^{T}}} + {\sum\limits_{k = 1}^{K}{\left\langle z_{k} \right\rangle\Lambda_{k}}}} \right\}}}{\hat{\mu} = {\left\{ {{\sum\limits_{n = 1}^{N}{{\Phi\left( x_{n} \right)}\left\langle L \right\rangle{\Phi\left( x_{n} \right)}^{T}}} + {\sum\limits_{k = 1}^{K}{\left\langle z_{k} \right\rangle\Lambda_{k}}}} \right\}^{- 1}\left\{ {{\sum\limits_{n = 1}^{N}{{\Phi\left( x_{n} \right)}\left\langle L \right\rangle{\Phi\left( x_{n} \right)}^{T}t_{n}}} + {\sum\limits_{k = 1}^{K}{\left\langle z_{k} \right\rangle\Lambda_{k}\mu_{k}}}} \right\}}}}} & \; \\ {\mspace{79mu}\left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 44} \right\rbrack} & \; \\ {\mspace{79mu}{{{q^{*}(\lambda)} = {\mathcal{G}\left( {{\lambda ❘\hat{a}},\hat{b}} \right)}}\mspace{79mu}{{wherein},}}} & (10) \\ {\mspace{79mu}\left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 45} \right\rbrack} & \; \\ {\mspace{79mu}{{\hat{a} = {\frac{\left( {N + 1} \right)D_{i}}{2} + \frac{D_{w}}{2} + {\sum\limits_{g = 1}^{G}{\left\langle \gamma_{g} \right\rangle a_{g}}}}}{\hat{b} = {\left\{ {{\sum\limits_{g = 1}^{G}{\left\langle \gamma_{g} \right\rangle b_{g}}} + {\frac{1}{2}{\sum\limits_{n = 1}^{N}{\left( {t_{n} - {{\Phi\left( x_{n} \right)}^{T}\hat{\mu}}} \right)^{T}\left\langle L \right\rangle\left( {t_{n} - {{\Phi\left( x_{n} \right)}^{T}\hat{\mu}}} \right)}}} + {\frac{1}{2}{\sum\limits_{n = 1}^{N}{{Trace}\left( {{\hat{\Lambda}}^{- 1}{\Phi\left( x_{n} \right)}\left\langle L \right\rangle{\Phi\left( x_{n} \right)}^{T}} \right)}}} + {\frac{1}{2}{\sum\limits_{k = 1}^{K}{\left\langle z_{k} \right\rangle\left( {\hat{\mu} - \mu_{k}} \right)^{T}{\Lambda_{k}\left( {\hat{\mu} - \mu_{k}} \right)}}}} + {\frac{1}{2}{\sum\limits_{k = 1}^{K}{\left\langle z_{k} \right\rangle{{Trace}\left( {{\hat{\Lambda}}^{- 1}\Lambda_{k}} \right)}\left( {1 - \frac{D_{i}}{2\hat{a}}} \right)^{- 1}}}}} \right\}\left( {1 - \frac{D_{i}}{2\hat{a}}} \right)^{- 1}}}}} & \; \\ {\mspace{79mu}\left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 46} \right\rbrack} & \; \\ {\mspace{79mu}{{{q^{*}(L)} = {\mathcal{W}\left( {{L❘\hat{v}},\hat{W}} \right)}}\mspace{79mu}{{wherein},}}} & (11) \\ {\mspace{79mu}\left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 47} \right\rbrack} & \; \\ {\mspace{79mu}{{\hat{v} = {{\sum\limits_{h = 1}^{H}{\left\langle \zeta_{h} \right\rangle v_{h}}} + N + 1}}{{\hat{W}}^{- 1} = {\left\{ {{\sum\limits_{h = 1}^{H}{\left\langle \zeta_{h} \right\rangle W_{h}^{- 1}}} + {\left\langle \lambda \right\rangle{\sum\limits_{n = 1}^{N}{\left( {t_{n} - {{\Phi\left( x_{n} \right)}^{T}\hat{\mu}}} \right)\left( {t_{n} - {{\Phi\left( x_{n} \right)}^{T}\hat{\mu}}} \right)^{T}}}} + {\left\langle \lambda \right\rangle{\sum\limits_{n = 1}^{N}{{\Phi\left( x_{n} \right)}^{T}{\hat{\Lambda}}^{- 1}{\Phi\left( x_{n} \right)}}}}} \right\}\left( {1 - \frac{1}{\hat{v}}} \right)^{- 1}}}}} & (12) \\ {\mspace{79mu}\left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 48} \right\rbrack} & \; \\ {\mspace{79mu}{{{q^{*}(z)} = {\sum\limits_{k = 1}^{K}r_{k}^{z_{k}}}}\mspace{79mu}{{wherein},}}} & (12) \\ {\mspace{79mu}\left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 49} \right\rbrack} & \; \\ {{{\ln\; r_{k}} = {{\frac{1}{2}\ln{\Lambda_{k}}} - {\frac{\left\langle \lambda \right\rangle}{2}\left( {\hat{\mu} - \mu_{k}} \right)^{T}{\Lambda_{k}\left( {\hat{\mu} - \mu_{k}} \right)}} - {\frac{\left\langle \lambda \right\rangle}{2}{{Trace}\left( {{\hat{\Lambda}}^{- 1}\Lambda_{k}} \right)}} + {\ln\;\pi_{k}} + {const}}}\mspace{79mu}{{\sum\limits_{k = 1}^{K}r_{k}} = {\quad 1}}} & \; \\ {\mspace{79mu}\left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 50} \right\rbrack} & \; \\ {\mspace{85mu}{{{q^{*}(\zeta)} = {\prod\limits_{h = 1}^{H}\;\rho_{h}^{\zeta_{h}}}}\mspace{79mu}{{wherein},}}} & (13) \\ {\mspace{79mu}\left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 51} \right\rbrack} & \; \\ {{{\ln\;\rho_{h}} = {{{- \frac{v_{h}}{2}}\ln{W_{h}}} - {\frac{v_{h}D_{i}}{2}\ln\; 2} - {\frac{D_{i}\left( {D_{i} - 1} \right)}{4}\ln\;\pi} - {\sum\limits_{i = 1}^{D_{i\;}}{\ln\;{\Gamma\left( \frac{v_{h} + 1 - i}{2} \right)}}} + {\frac{v_{h} - D_{i} - 1}{2}\left\langle {\ln{L}} \right\rangle} - {\frac{1}{2}{{Trace}\left( {W_{h}^{- 1}\left\langle L_{m} \right\rangle} \right)}} + {\ln\;\eta_{h}} + {const}}}\mspace{79mu}{{\sum\limits_{h = 1}^{H}\rho_{h}} = 1}} & \; \\ {\mspace{79mu}\left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 52} \right\rbrack} & \; \\ {\mspace{79mu}{{{q^{*}(\gamma)} = {\prod\limits_{g = 1}^{G}\; s_{g}^{\gamma_{g}}}}\mspace{79mu}{{wherein},}}} & (14) \\ {\mspace{79mu}\left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 53} \right\rbrack} & \; \\ {{\ln\; s_{g}} = {{{- \ln}\;{\Gamma\left( a_{g} \right)}} + {a_{g}\ln\; b_{g}} + {\left( {a_{g} - 1} \right)\left\langle {\ln\;\lambda} \right\rangle} - {b_{g}\left\langle \lambda \right\rangle} + {\ln\;\theta_{g}} + {const}}} & \; \\ {\mspace{76mu}{{\sum\limits_{g = 1}^{G}s_{g}} = 1}} & \; \end{matrix}$

Specifically, the posterior distribution after to (n=1, 2, . . . , N) is obtained, is inferred as below, using the mean field approximation q(t _(N+1) ,w,λ,L,z,ζ,γ)=q(t _(N+1) |w)q(w)q(λ)q(L)q(z)q(ζ)q(γ)  [Numerical Formula 40] Specifically, the optimal variational posterior distributions are as shown in Formula (8) to Formula (14) below. [Numerical Formula 41] q*(t _(N+1) |w)=N(t _(N+1)|Φ(x _(N+1))^(T) w,<λ> ⁻¹ <L> ⁻¹)  (8) [Numerical Formula 42] q*(w)=N(w|{circumflex over (μ)},{circumflex over (Λ)} ⁻¹)  (9) wherein,

$\begin{matrix} \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 43} \right\rbrack & \; \\ {{\hat{\Lambda} = {\left\langle \lambda \right\rangle\left\{ {{\sum\limits_{n = 1}^{N}\;{{\Phi\left( x_{n} \right)}\left\langle L \right\rangle{\Phi\left( x_{n} \right)}^{T}}} + {\sum\limits_{k = 1}^{K}\;{\left\langle z_{k} \right\rangle\Lambda_{k}}}} \right\}}}{\hat{\mu} = {\left\{ {{\sum\limits_{n = 1}^{N}\;{{\Phi\left( x_{n} \right)}\left\langle L \right\rangle{\Phi\left( x_{n} \right)}^{T}}} + {\sum\limits_{k = 1}^{K}\;{\left\langle z_{k} \right\rangle\Lambda_{k}}}} \right\}^{- 1}\left\{ {{\sum\limits_{n = 1}^{N}\;{{\Phi\left( x_{n} \right)}\left\langle L \right\rangle{\Phi\left( x_{n} \right)}^{T}t_{n}}} + {\sum\limits_{k = 1}^{K}\;{\left\langle z_{k} \right\rangle\Lambda_{k}\mu_{k}}}} \right)}}} & \; \end{matrix}$ [Numerical Formula 44] q*(λ)=G(λ|â,{circumflex over (b)})  (10) wherein,

$\begin{matrix} \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 45} \right\rbrack & \; \\ {{\hat{a} = {\frac{\left( {N + 1} \right)D_{t}}{2} + \frac{D_{w}}{2} + {\sum\limits_{g = 1}^{G}\;{\left\langle \gamma_{g} \right\rangle a_{g}}}}}{\hat{b} = {\left\{ {{\sum\limits_{g = 1}^{G}\;{\left\langle \gamma_{g} \right\rangle b_{g}}} + {\frac{1}{2}{\sum\limits_{n = 1}^{N}\;{\left( {t_{n} - {{\Phi\left( x_{n} \right)}^{T}\hat{\mu}}} \right)^{T}\left\langle L \right\rangle\left( {t_{n} - {{\Phi\left( x_{n} \right)}^{T}\hat{\mu}}} \right)}}} + {\frac{1}{2}{\sum\limits_{n = 1}^{N}\;{{Trace}\left( {{\hat{\Lambda}}^{- 1}{\Phi\left( x_{n} \right)}\left\langle L \right\rangle{\Phi\left( x_{n} \right)}^{T}} \right)}}} + {\frac{1}{2}{\sum\limits_{k = 1}^{K}\;{\left\langle z_{k} \right\rangle\left( {\hat{\mu} - \mu_{k}} \right)^{T}{\Lambda_{k}\left( {\hat{\mu} - \mu_{k}} \right)}}}} + {\frac{1}{2}{\sum\limits_{k = 1}^{K}\;{\left\langle z_{k} \right\rangle{{Trace}\left( {{\hat{\Lambda}}^{- 1}\Lambda_{k}} \right)}\left( {1 - \frac{D_{t}}{2\hat{a}}} \right)^{- 1}}}}} \right\}\left( {1 - \frac{D_{t}}{2\hat{a}}} \right)^{- 1}}}} & \; \end{matrix}$ [Numerical Formula 46] q*(L)=W(L|{circumflex over (ν)},Ŵ)  (11) wherein,

$\begin{matrix} \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 47} \right\rbrack & \; \\ {{\hat{v} = {{\sum\limits_{h = 1}^{H}\;{\left\langle \zeta_{h} \right\rangle v_{h}}} + N + 1}}{{\hat{W}}^{- 1} = {\left\{ {{\sum\limits_{h = 1}^{H}\mspace{11mu}{\left\langle \zeta_{h} \right\rangle W_{h}^{- 1}}} + {\left\langle \lambda \right\rangle{\sum\limits_{n = 1}^{N}\;{\left( {t_{n} - {{\Phi\left( x_{n} \right)}^{T}\hat{\mu}}} \right)\left( {t_{n} - {{\Phi\left( x_{n} \right)}^{T}\hat{\mu}}} \right)^{T}}}} + {\left\langle \lambda \right\rangle{\sum\limits_{n = 1}^{N}\;{{\Phi\left( x_{n} \right)}^{T}{\hat{\Lambda}}^{- 1}{\Phi\left( x_{n} \right)}}}}} \right\}\left( {1 - \frac{1}{\hat{v}}} \right)^{- 1}}}} & \; \end{matrix}$

$\begin{matrix} \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 48} \right\rbrack & \; \\ {{q^{*}(z)} = {\prod\limits_{k = 1}^{K}\; r_{k}^{z_{k}}}} & (12) \end{matrix}$ wherein,

$\begin{matrix} \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 49} \right\rbrack & \; \\ {{\ln\mspace{11mu} r_{k}} = {{{\frac{1}{2}\ln{\Lambda_{k}}} - {\frac{\left\langle \lambda \right\rangle}{2}\left( {\hat{\mu} - \mu_{k}} \right)^{T}{\Lambda_{k}\left( {\hat{\mu} - \mu_{k}} \right)}} - {\frac{\left\langle \lambda \right\rangle}{2}{{Trace}\left( {{\hat{\Lambda}}^{- 1}\Lambda_{k}} \right)}} + {\ln\mspace{11mu}\pi_{k}} + {{const}{\sum\limits_{k = 1}^{K}\; r_{k}}}} = 1}} & \; \\ \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 50} \right\rbrack & \; \\ {{q^{*}(\zeta)} = {\prod\limits_{h = 1}^{H}\;\rho_{h}^{\zeta_{h}}}} & (13) \end{matrix}$ wherein,

$\begin{matrix} \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 51} \right\rbrack & \; \\ {{\ln\mspace{11mu}\rho_{h}} = {{{{- \frac{v_{h}}{2}}\ln{W_{h}}} - {\frac{v_{h}D_{t}}{2}\ln\mspace{11mu} 2} - {\frac{D_{t}\left( {D_{t} - 1} \right)}{4}\ln\mspace{11mu}\pi} - {\sum\limits_{i = 1}^{D_{t}}\;{\ln\mspace{11mu}{\Gamma\left( \frac{v_{h} + 1 - i}{2} \right)}}} + {\frac{v_{h} - D_{t} - 1}{2}\left\langle {\ln{L}} \right\rangle} - {\frac{1}{2}{{Trace}\left( {W_{h}^{- 1}\left\langle L_{m} \right\rangle} \right)}} + {\ln\mspace{11mu}\eta_{k}} + {{const}{\sum\limits_{h = 1}^{H}\;\rho_{h}}}} = 1}} & \; \\ \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 52} \right\rbrack & \; \\ {{q^{*}(\gamma)} = {\prod\limits_{g = 1}^{G}\; S_{g}^{\gamma_{g}}}} & (14) \end{matrix}$ wherein,

$\begin{matrix} \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 53} \right\rbrack & \; \\ {{\ln\mspace{11mu} s_{g}} = {{{{- \ln}\mspace{11mu}{\Gamma\left( a_{g} \right)}} + {a_{g}\ln\mspace{11mu} b_{g}} + {\left( {a_{g} - 1} \right)\left\langle {\ln\mspace{11mu}\lambda} \right\rangle} - {b_{g}\left\langle \lambda \right\rangle} + {\ln\mspace{11mu}\theta_{g}} + {{const}{\sum\limits_{g = 1}^{G}\; s_{g}}}} = 1}} & \; \end{matrix}$ With this respect, the following are satisfied.

$\begin{matrix} \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 54} \right\rbrack & \; \\ {\left\langle \lambda \right\rangle = \frac{\hat{a}}{\hat{b}}} & \; \end{matrix}$ <ln λ>=ψ(â)−ln {circumflex over (b)} <L>={circumflex over (v)}Ŵ

$\left\langle {\ln\mspace{11mu} L} \right\rangle = {{\sum\limits_{i = 1}^{D_{t}}\;{\psi\left( \frac{\hat{v} + 1 - i}{2} \right)}} + {D_{t\mspace{11mu}}\ln\mspace{11mu} 2} + {\ln{\hat{W}}}}$ <z _(k) >=r _(k) <ζ_(h)>=ρ_(h) <γ_(g) >=s _(g) Further, parameters which have been previously calculated and stored in the storage unit 12 are used for v,W,μ,Λ,a,b,π,θ,η  [Numerical Formula 9]

The inference result of tN+1 that the control unit 11 should obtain, is obtained by Formula (15).

$\begin{matrix} {\mspace{79mu}\left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 55} \right\rbrack} & \; \\ \begin{matrix} {{q\left( t_{N + 1} \right)} = {\int{{\mathcal{N}\left( {{t_{N + 1}❘{{\Phi\left( x_{N + 1} \right)}^{T}w}},{\left\langle \lambda \right\rangle^{- 1}\left\langle L \right\rangle^{- 1}}} \right)}{\mathcal{N}\left( {{w❘\hat{\mu}},{\hat{\Lambda}}^{- 1}} \right)}{\mathbb{d}w}}}} \\ {= {\mathcal{N}\left( {{t_{N + 1}❘{{\Phi\left( x_{N + 1} \right)}^{T}\hat{\mu}}},{{\left\langle \lambda \right\rangle^{- 1}\left\langle L \right\rangle^{- 1}} + {{\Phi\left( x_{N + 1} \right)}^{T}{\hat{\Lambda}}^{- 1}{\Phi\left( x_{N + 1} \right)}}}} \right)}} \end{matrix} & (15) \end{matrix}$ According to the multivariate normal distribution represented by Formula (15), the control unit 11 obtains the inference test result vector tN+1 which indicates an inference result of visual sensitivity at each test point in the current visual field test. Then, the control unit 11 executes an information output process on the basis of the obtained inference result vector tN+1. The information output process will be described below.

In the above calculation, the lower bound of the likelihood P(T) is represented as follows.

     [Numerical  Formula  56] ${\mathcal{L}\mathcal{B}} = {{{\left\lbrack {\ln\;{\mathcal{N}\left( {{t_{N + 1}❘{{\Phi\left( x_{N + 1} \right)}w}},{\lambda^{- 1}L^{- 1}}} \right)}} \right\rbrack}{\sum\limits_{n = 1}^{N}{\left\lbrack {\ln\;{\mathcal{N}\left( {{t_{n}❘{{\Phi\left( x_{n} \right)}w}},{\lambda^{- 1}L^{- 1}}} \right)}} \right\rbrack}}} + {\sum\limits_{k = 1}^{K}{\left\lbrack {z_{k}\ln\;{\mathcal{N}\left( {{w❘\mu_{k}},{\lambda^{- 1}\Lambda_{k}^{- 1}}} \right)}} \right\rbrack}} + {\sum\limits_{k = 1}^{K}{\left\lbrack {z_{k}\ln\;\pi_{k}} \right\rbrack}} + {\sum\limits_{h = 1}^{H}{\left\lbrack {\zeta_{h}\ln\;{\mathcal{W}\left( {{L❘v_{h}},W_{h}} \right)}} \right\rbrack}} + {\sum\limits_{n = 1}^{H}{\left\lbrack {\zeta_{h}\ln\;\eta_{h}} \right\rbrack}} + {\sum\limits_{g = 1}^{G}{\left\lbrack {\gamma_{g}\ln\;{\mathcal{G}\left( {{\lambda ❘a_{g}},b_{g}} \right)}} \right\rbrack}} + {\sum\limits_{g = 1}^{G}{\left\lbrack {\gamma_{g}\ln\;\theta_{g}} \right\rbrack}} + {- {\left\lbrack {\ln\;{\mathcal{N}\left( {{t_{N + 1}❘{{\Phi\left( x_{N + 1} \right)}w}},{\left\langle \lambda \right\rangle^{1}\left\langle L \right\rangle^{1}}} \right)}} \right\rbrack}} + {- {\left\lbrack {\ln\;{\mathcal{N}\left( {{w❘\hat{\mu}},{\hat{\Lambda}}^{- 1}} \right)}} \right\rbrack}} + {- {\left\lbrack {\ln\;{\mathcal{G}\left( {{\lambda ❘\hat{a}},\hat{b}} \right)}} \right\rbrack}} + {- {\left\lbrack {\ln\;{\mathcal{W}\left( {{L❘\hat{v}},\hat{W}} \right)}} \right\rbrack}} + {- {\sum\limits_{k = 1}^{K}{r_{k}\ln\; r_{k}}}} + {- {\sum\limits_{h = 1}^{H}{\rho_{h}\ln\;\rho_{h}}}} + {- {\sum\limits_{g = 1}^{G}{s_{g}\ln\; s_{g}}}}}$ The sum of the 1st and 9th terms is represented as follows.

$\begin{matrix} {{{\left\lbrack {\ln\;{\mathcal{N}\left( {\left. t_{N + 1} \middle| {{\Phi\left( x_{N + 1} \right)}w} \right.,\lambda^{- 1},L^{- 1}} \right)}} \right\rbrack} - {\left\lbrack {\ln\;{\mathcal{N}\left( {\left. t_{N + 1} \middle| {{\Phi\left( x_{N + 1} \right)}w} \right.,\left\langle \lambda \right\rangle^{- 1},\left\langle L \right\rangle^{- 1}} \right)}} \right\rbrack}} = {{\frac{D_{t}}{2}\left( {\left\langle {\ln\;\lambda} \right\rangle - {\ln\left\langle \lambda \right\rangle}} \right)} + {\frac{1}{2}\left( {\left\langle {\ln{L}} \right\rangle - {\ln{\left\langle L \right\rangle }}} \right)}}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 57} \right\rbrack \end{matrix}$ Other terms of the expectation values can be represented as follows.

$\begin{matrix} {{{{{{{{{{\sum\limits_{n = 1}^{N}{\left\lbrack {\ln\;{\mathcal{N}\left( {\left. t_{n} \middle| {{\Phi\left( x_{n} \right)}w} \right.,{\lambda^{1}L^{1}}} \right)}} \right\rbrack}} = -}\quad}\frac{{ND}_{t}}{2}\ln\; 2\;\pi} + {\frac{{ND}_{t}}{2}\left\langle {\ln\;\lambda} \right\rangle} + {\frac{N}{2}\left\langle {\ln{L}} \right\rangle} + -}\quad}\frac{1}{2}{\sum\limits_{n = 1}^{N}{\left\langle \lambda \right\rangle\left( {t_{n} - {{\Phi\left( x_{n} \right)}^{T}\hat{\mu}}} \right)^{T}\left\langle L \right\rangle\left( {t_{n} - {{\Phi\left( x_{n} \right)}^{T}\hat{\mu}}} \right)}}} + -}\quad}\frac{1}{2}{\sum\limits_{n = 1}^{N}{\left\langle \lambda \right\rangle{{Trace}\left( {{\hat{\Lambda}}^{1}{\Phi\left( x_{n} \right)}\left\langle L \right\rangle{\Phi\left( x_{n} \right)}^{T}} \right)}}}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 58} \right\rbrack \\ {{{{{{{{{\sum\limits_{k = 1}^{K}{\left\lbrack {z_{k}\ln\;{\mathcal{N}\left( {\left. w \middle| \mu_{k} \right.,{\lambda^{- 1}\Lambda_{k}^{- 1}}} \right)}} \right\rbrack}} = -}\quad}\frac{D_{w}}{2}\ln\; 2\;\pi} + {\frac{D_{w}}{2}\left\langle {\ln\;\lambda_{m}} \right\rangle} + {\frac{1}{2}{\sum\limits_{k = 1}^{K}{\left\langle z_{k} \right\rangle\ln{\Lambda_{k}}}}} + -}\quad}\frac{\left\langle \lambda \right\rangle}{2}{\sum\limits_{k - 1}^{K}{\left\langle z_{k} \right\rangle\left( {\hat{\mu} - \mu_{k}} \right)^{T}{\Lambda_{k}\left( {\hat{\mu} - \mu_{k}} \right)}}}} - {\frac{\left\langle \lambda \right\rangle}{2}{{Trace}\left( {{\hat{\Lambda}}^{- 1}{\sum\limits_{k - 1}^{K}{\left\langle z_{k} \right\rangle{\hat{\Lambda}}_{k}}}} \right)}}},\mspace{20mu}{{\sum\limits_{k = 1}^{K}{\left\lbrack {z_{k}\ln\;\pi_{k}} \right\rbrack}} = {\sum\limits_{k = 1}^{K}{r_{k}\ln\;\pi_{k}}}}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 59} \right\rbrack \\ {{{\sum\limits_{h = 1}^{H}{\left\lbrack {\zeta_{h}\ln\;{\mathcal{W}\left( {\left. L \middle| v_{h} \right.,W_{h}} \right)}} \right\rbrack}} = {{\sum\limits_{h - 1}^{H}{\left\langle \zeta_{h} \right\rangle\left( {{{- \frac{v_{h}}{2}}\ln{W_{h}}} - {\frac{v_{h}D_{1}}{2}\ln\; 2} - {\sum\limits_{i - 1}^{D_{i}}{\ln\;{\Gamma\left( \frac{v_{h} + 1 - i}{2} \right)}}} + {\frac{v_{h} - D_{i} + 1}{2}\left\langle {\ln{L}} \right\rangle}} \right)}} - {\frac{1}{2}{{Trace}\left( {\left\langle L \right\rangle{\sum\limits_{h - 1}^{H}{\left\langle \zeta_{h} \right\rangle W_{h}^{- 1}}}} \right)}} - {\frac{D_{t}\left( {D_{t} - 1} \right)}{4}\ln\;\pi}}},\mspace{20mu}{{\sum\limits_{n = 1}^{H}{\left\lbrack {\zeta_{h}\ln\;\eta_{k}} \right\rbrack}} = {\sum\limits_{h = 1}^{H}{\rho_{h}\ln\;\eta_{h}}}},{{\sum\limits_{g - 1}^{G}{\left\lbrack {\gamma_{g}\ln\;{\mathcal{G}\left( {\left. \lambda \middle| a_{g} \right.,b_{g}} \right)}} \right\rbrack}} = {\sum\limits_{g = 1}^{G}{\left\langle \gamma_{g} \right\rangle\left( {{{- \ln}\;{\Gamma\left( a_{g} \right)}} + {a_{g}\ln\; b_{g}} + {\left( {a_{g} - 1} \right)\left\langle {\ln\;\lambda} \right\rangle} - {b_{g}\left\langle \lambda \right\rangle}} \right)}}},\mspace{20mu}{{\sum\limits_{g = 1}^{G}{\left\lbrack {\gamma_{g}\ln\;\theta_{g}} \right\rbrack}} = {\sum\limits_{g = 1}^{G}{s_{g}\ln\;\theta_{g}}}}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 60} \right\rbrack \\ {{{- {\left\lbrack {\ln\;{\mathcal{N}\left( {\left. w \middle| \hat{\mu} \right.,{\hat{\Lambda}}^{1}} \right)}} \right\rbrack}} = {{{- \frac{D_{w}}{2}}\ln\; 2\;\pi} + {\frac{1}{2}\ln{\hat{\Lambda}}} - \frac{D_{w}}{2}}},{{- {\left\lbrack {\ln\;{\mathcal{G}\left( {\left. \lambda \middle| \hat{a} \right.,\hat{b}} \right)}} \right\rbrack}} = {{{- \ln}\;{\Gamma\left( \hat{a} \right)}} + {\left( {\hat{a} - 1} \right){\psi\left( \hat{a} \right)}} + {\ln\hat{b}} - \hat{a}}},{{- {\left\lbrack {\ln\;{\mathcal{W}\left( {\left. L \middle| \hat{v} \right.,\hat{W}} \right)}} \right\rbrack}} = {{{- \frac{\hat{v}}{2}}\ln{\hat{W}}} - {\frac{D_{t}\hat{v}}{2}\ln\; 2} - {\sum\limits_{i = 1}^{D_{i}}{\ln\;{\Gamma\left( \frac{v + 1 - i}{2} \right)}}} + {\frac{\hat{v} - D_{t} - 1}{2}\left\langle {\ln{L}} \right\rangle} - \frac{D_{t}\hat{v}}{2} - {\frac{D_{t}\left( {D_{t} - 1} \right)}{4}\ln\;\pi}}}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 61} \right\rbrack \end{matrix}$

Further, the control unit 11 updates the content of the information output during the actual visual field test. Namely, when the visual field test is performed and a part of the actual test results (visual sensitivity information of a part of the test points) is input through the input/output unit 15, the control unit 11 updates the prior-distribution with reference to the visual sensitivity information of the test points which has already been obtained by the time of the inference process. Specifically, the control unit 11 divides the test result vector tN+1 into the visual sensitivity information (vector) to indicating the visual sensitivity information of the test points which has not been obtained by time of the process, and the visual sensitivity information (vector) tb indicating the visual sensitivity information of the test points which has already been obtained by the time of the process. For convenience, the divided elements are represented as

$\begin{matrix} {t = \begin{pmatrix} t_{a} \\ t_{b} \end{pmatrix}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 62} \right\rbrack \end{matrix}$ (if the order of measurement is predetermined among the test points, the elements of the vector t may be set in the order of measurement). The corresponding μ and Λ are represented as below.

$\begin{matrix} {\mu = {{\begin{pmatrix} \mu_{a} \\ \mu_{b} \end{pmatrix}\mspace{14mu}\Lambda} = \begin{pmatrix} \Lambda_{aa} & \Lambda_{ab} \\ \Lambda_{ba} & \Lambda_{bb} \end{pmatrix}}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 63} \right\rbrack \end{matrix}$ Then, the control unit 11 calculates the inference result to of the unmeasured test points as a partial inference test result vector, using the following equation. P(t _(a) |t _(b))=N(t _(a)|μ_(a)−Λ_(aa) ⁻¹Λ_(ab)(t _(b)−μ_(b)),Λ_(aa) ⁻¹)  [Numerical Formula 64] Thereby, provided that each of a plurality of unmeasured test points is a noted test point, the inference test result information at the noted test point can be obtained.

The control unit 11 executes an information output process, on the basis of the thus obtained inference result ta(P(ta|tb)). The information output process will be explained later below.

[For a Patient Who Undergoes the Visual Field Test for the First Time]

In case of a patient who undergoes the visual field test for the first time, no past information is present. Therefore, upon receiving instructions to perform inference regarding a patient who undergoes the visual field test for the first time, the control unit 11 infers the posterior distribution which should be the inference result of the visual sensitivity information at each test point, by performing approximate inference using a mixture normal distribution.

Specifically, similar to the case of a patient which has already undergone the visual field test for N times, the full likelihood at the time point 0 is set as the following equation.

$\begin{matrix} {{P\left( {t_{0},w,\lambda,L,z,\zeta,\gamma} \right)} = {{\mathcal{N}\left( {\left. t_{0} \middle| {{\Phi(0)}w} \right.,{\lambda^{- 1}L^{- 1}}} \right)}{\prod\limits_{k = 1}^{K}\;{\left\{ {\mathcal{N}\left( {\left. w \middle| \mu_{k} \right.,{\lambda^{- 1}\Lambda_{k}^{- 1}}} \right)} \right\}^{z_{k}}{\prod\limits_{k = 1}^{K}\;{\pi_{k}^{z_{k}}{\prod\limits_{h = 1}^{H}\;{\left\{ {\mathcal{W}\left( {\left. L \middle| v_{h} \right.,W_{h}} \right)} \right\}^{\zeta_{h}}{\prod\limits_{h = 1}^{H}\;{\eta_{h}^{\zeta_{h}}{\prod\limits_{g = 1}^{G}\;{{\mathcal{G}\left( {\left. \lambda \middle| a_{g} \right.,b_{g}} \right)}^{\gamma_{g}}{\prod\limits_{g = 1}^{G}\;\theta_{g}^{\gamma_{g}}}}}}}}}}}}}}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 65} \right\rbrack \end{matrix}$ This equation is approximated as P(t ₀ ,w,λ,L,z,ζ,γ)=q(t ₀ |w)q(w|z)q(z)q(λ)q(γ)q(L)q(ζ)  [Numerical Formula 66] The control unit 11 obtains a mixture normal distribution to minimize Kullback-Leibler divergence represented by the formula below.

$\begin{matrix} {- {\int{{q\left( t_{0} \middle| w \right)}{q\left( w \middle| z \right)}{q(z)}{q(\lambda)}{q(\gamma)}{q(L)}{q(\zeta)}\frac{P\left( {t_{0},w,\lambda,L,z,\zeta,\gamma} \right)}{{q\left( t_{0} \middle| w \right)}{q\left( w \middle| z \right)}{q(z)}{q(\lambda)}{q(\gamma)}{q(L)}{q(\zeta)}}{\mathbb{d}t_{o}}w\;\lambda\;{Lz}\;\zeta\;\gamma}}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{20mu} 67} \right\rbrack \end{matrix}$ In the mixture normal distribution,

$\begin{matrix} {\mspace{79mu}{{{q^{*}\left( t_{0} \middle| w \right)} = {N\left( {\left. t_{0} \middle| {{\Phi(0)}w} \right.,{\left\langle \lambda \right\rangle^{- 1}\left\langle L \right\rangle^{- 1}}} \right)}}\mspace{20mu}{{q^{*}\left( w \middle| z \right)} = {\prod\limits_{k = 1}^{K}\;{\left\{ {\mathcal{N}\left( {\left. w \middle| \mu_{k} \right.,{\left\langle \lambda \right\rangle^{- 1}\Lambda_{k}^{1}}} \right)} \right\} z_{k}}}}\mspace{20mu}{{q^{*}(z)} = {\prod\limits_{k = 1}^{K}\;\pi_{k}^{z_{k}}}}\mspace{20mu}{{q^{*}(\lambda)} = {\mathcal{G}\left( {\left. \lambda \middle| \hat{a} \right.,\hat{b}} \right)}}\mspace{20mu}{{wherein},}}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 68} \right\rbrack \\ {\mspace{79mu}{{\hat{a} = {{\sum\limits_{g - 1}^{G}{\left\langle \gamma_{g} \right\rangle a_{g}}} + \frac{D_{w} + D_{t}}{2}}}\mspace{79mu}{\hat{b} = {\left( {\sum\limits_{g - 1}^{G}{\left\langle \gamma_{g} \right\rangle b_{g}}} \right)\left( {1 - \frac{D_{t} + D_{w}}{\hat{2}}} \right)^{- 1}}}}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 69} \right\rbrack \\ {\mspace{79mu}{{{q^{*}(L)} = {W\left( {\left. L \middle| \hat{v} \right.,\hat{W}} \right)}}\mspace{20mu}{{wherein},}}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 70} \right\rbrack \\ {\mspace{79mu}{{\hat{v} = {{\sum\limits_{h = 1}^{H}{\left\langle \zeta_{h} \right\rangle v_{h}}} + 1}}\mspace{79mu}{{\hat{W}}^{- 1} = {\left( {\sum\limits_{h - 1}^{H}{\left\langle \zeta \right\rangle W_{h}^{1}}} \right)\left( {1 - \frac{1}{\hat{v}}} \right)^{1}}}}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 71} \right\rbrack \\ {\mspace{79mu}{{{q^{*}(\gamma)} = {\prod\limits_{g - 1}^{G}\; s_{g}^{z_{k}}}}\mspace{79mu}{{q^{*}(\lambda)} = {\mathcal{G}\left( {\left. \lambda \middle| \hat{a} \right.,\hat{b}} \right)}}\mspace{20mu}{{wherein},}}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 72} \right\rbrack \\ {\mspace{79mu}{{\hat{a} = {{\sum\limits_{g - 1}^{G}{\left\langle \gamma_{g} \right\rangle a_{g}}} + \frac{D_{w} + D_{t}}{2}}}\mspace{79mu}{\hat{b} = {\left( {\sum\limits_{g - 1}^{G}{\left\langle \gamma_{g} \right\rangle b_{g}}} \right)\left( {1 - \frac{D_{t} + D_{w}}{\hat{2}}} \right)^{- 1}}}}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 69} \right\rbrack \\ {\mspace{79mu}{{{q^{*}(L)} = {W\left( {\left. L \middle| \hat{v} \right.,\hat{W}} \right)}}\mspace{20mu}{{wherein},}}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 70} \right\rbrack \\ {\mspace{79mu}{{\hat{v} = {{\sum\limits_{h = 1}^{H}{\left\langle \zeta_{h} \right\rangle v_{h}}} + 1}}\mspace{79mu}{{\hat{W}}^{- 1} = {\left( {\sum\limits_{h - 1}^{H}{\left\langle \zeta_{h} \right\rangle W_{h}^{1}}} \right)\left( {1 - \frac{1}{\hat{v}}} \right)^{- 1}}}}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 71} \right\rbrack \\ {\mspace{79mu}{{{q^{*}(\gamma)} = {\prod\limits_{g - 1}^{G}\; s_{g}^{\gamma_{g}}}}\mspace{20mu}{{wherein},}}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 72} \right\rbrack \\ {{{\ln\; s_{g}} = {{\ln\;{\Gamma\left( a_{g} \right)}} + {a_{g}\ln\; b_{g}} + {\left( {a_{g} - 1} \right)\left\langle {\ln\;\lambda} \right\rangle} - {b_{g}\left\langle \lambda \right\rangle} + {\ln\;\theta_{g}} + {const}}}\mspace{20mu}{{\sum\limits_{g = 1}^{G}s_{g}} = 1}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 73} \right\rbrack \\ {\mspace{79mu}{{{q^{*}(\zeta)} = {\prod\limits_{h = 1}^{H}\;\rho_{h}^{\zeta_{h}}}}\mspace{20mu}{{wherein},}}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 74} \right\rbrack \\ {{{\ln\;\rho_{h}} \propto {{{- \frac{v_{h}}{2}}\ln{W_{h}}} - {\frac{v_{h}D_{t}}{2}\ln\; 2} - {\frac{D_{t}\left( {D_{t} - 1} \right)}{4}\ln\;\pi} - {\sum\limits_{i = 1}^{D_{t}}{\ln\;{\Gamma\left( \frac{v_{h} + 1 - i}{2} \right)}}} + {\frac{v_{h} - D_{i} - 1}{2}\left\langle {\ln{L}} \right\rangle} - {\frac{1}{2}{{Trace}\left( {W_{h}^{- 1}\left\langle L_{m} \right\rangle} \right)}} + {\ln\;\eta_{h}} + {const}}}\mspace{20mu}{{\sum\limits_{h = 1}^{H}\rho_{h}} = 1}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 75} \right\rbrack \end{matrix}$

The control unit 11 uses a predetermined mixture normal distribution function, and appropriately (for example, randomly) sets initial values for the parameters of the function. The control unit 11 repeats the process of calculating the Kullback-Leibler divergence of the mixture normal distribution function, updating the parameters to minimize the Kullback-Leibler divergence, and calculating the Kullback-Leibler divergence again, until the Kullback-Leibler divergence converges. The specific embodiment for this calculation can be a widely known method.

With respect to “t0” which has become the optimal distribution by the above process, the control unit 11 obtains q(t ₀ |w)q(w|z)q(z)  [Numerical Formula 76] Further, the control unit 11 marginalizes the above regarding w and z, to obtain “t0”. Specifically, the control unit 11 calculates the following equation to obtain “t0”.

$\begin{matrix} {{\sum\limits_{z}{\int{{q\left( t_{0} \middle| w \right)}{q\left( w \middle| z \right)}{q(z)}{\mathbb{d}w}}}} = {\sum\limits_{k = 1}^{K}{\pi_{k}{\mathcal{N}\left( {\left. t_{N + 1} \middle| {{\Phi(0)}\hat{\mu}} \right.,{{\left\langle \lambda \right\rangle^{- 1}\left\langle L \right\rangle^{- 1}} + {{\Phi(0)}^{T}\Lambda_{k}^{- 1}{\Phi(0)}}}} \right)}}}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 77} \right\rbrack \end{matrix}$ For these calculations, the control unit 11 uses parameter values stored in the storage unit 12. Further, the Kullback-Leibler divergence at this time can be represented as follows.

$\begin{matrix} {{KL} = {{- {\sum\limits_{k = 1}^{K}{\left\lbrack {z_{k}\ln\;\pi_{k}} \right\rbrack}}} + {- {\sum\limits_{h = 1}^{H}{\left\lbrack {\zeta_{h}\ln\;{\mathcal{W}\left( {\left. L \middle| v_{h} \right.,W_{h}} \right)}} \right\rbrack}}} + {- {\sum\limits_{h = 1}^{H}{\left\lbrack {\zeta_{h}\ln\;\eta_{h}} \right\rbrack}}} + {- {\sum\limits_{g = 1}^{G}{\left\lbrack {\gamma_{g}\ln\;{\mathcal{G}\left( {\left. \lambda \middle| a_{g} \right.,b_{g}} \right)}} \right\rbrack}}} + {- {\sum\limits_{g = 1}^{G}{\left\lbrack {\gamma_{g}\ln\;\theta_{g}} \right\rbrack}}} + {{\left\lbrack {\ln\;{N\left( {\left. t_{0} \middle| {{\Phi\left( x_{0} \right)}w} \right.,{\left\langle \lambda \right\rangle^{- 1}\left\langle L \right\rangle^{- 1}}} \right)}} \right\rbrack}{\sum\limits_{k = 1}^{K}{\left\lbrack {z_{k}\ln\;{\mathcal{N}\left( {\left. w \middle| \mu_{k} \right.,{\left\langle \lambda \right\rangle^{1}\Lambda_{k}^{- 1}}} \right)}} \right\rbrack}}} + {\sum\limits_{k = 1}^{K}{\left\lbrack {z_{k}\ln\;\pi_{k}} \right\rbrack}} + {\left\lbrack {\ln\;{\mathcal{G}\left( {\left. \lambda \middle| \hat{a} \right.,\hat{b}} \right)}} \right\rbrack} + {\left\lbrack {\ln\;{\mathcal{W}\left( {\left. L \middle| \hat{v} \right.,\hat{W}} \right)}} \right\rbrack} + {\sum\limits_{h = 1}^{H}{\rho_{h}\ln\;\rho_{h}}} + {\sum\limits_{g = 1}^{G}{s_{g}\ln\; s_{g}}}}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 78} \right\rbrack \end{matrix}$ Here, the 3rd term and 10th term cancel to each other. The sum of the 1st term and the 8th term is represented as

$\begin{matrix} {{{- {\left\lbrack {\ln\;{\mathcal{N}\left( {\left. t_{0} \middle| {{\Phi\left( x_{0} \right)}w} \right.,\lambda^{- 1},L^{- 1}} \right)}} \right\rbrack}} + {\left\lbrack {\ln\;{\mathcal{N}\left( {\left. t_{0} \middle| {{\Phi\left( x_{0} \right)}w} \right.,\left\langle \lambda \right\rangle^{- 1},\left\langle L \right\rangle^{- 1}} \right)}} \right\rbrack}} = {{\frac{D_{t}}{2}\left( {{\ln\left\langle \lambda \right\rangle} - \left\langle {\ln\;\lambda} \right\rangle} \right)} + {\frac{1}{2}\left( {{\ln{\left\langle L \right\rangle }} - \left\langle {\ln{L}} \right\rangle} \right)}}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 79} \right\rbrack \end{matrix}$ The sum of the 2nd term and the 9th term is represented as

$\begin{matrix} {{{- {\sum\limits_{k = 1}^{K}{\left\lbrack {z_{k}\ln\;{\mathcal{N}\left( {\left. w \middle| \mu_{k} \right.,{\lambda^{- 1}\Lambda_{k}^{- 1}}} \right)}} \right\rbrack}}} + {\sum\limits_{k - 1}^{K}{\left\lbrack {z_{k}\ln\;{\mathcal{N}\left( {\left. w \middle| \mu_{k} \right.,{\left\langle \lambda \right\rangle^{- 1}\Lambda_{k}^{- 1}}} \right)}} \right\rbrack}}} = {\frac{D_{w}}{2}{\left( {{\ln\left\langle \lambda \right\rangle} - \left\langle {\ln\;\lambda} \right\rangle} \right).}}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 80} \right\rbrack \end{matrix}$ The expectation values for the 4th term to the 7th term, the 11th term, and the 12th term can be represented as below, respectively.

$\begin{matrix} {{{- {\sum\limits_{h = 1}^{H}{\left\lbrack {\zeta_{h}\ln\;{\mathcal{W}\left( {\left. L \middle| v_{h} \right.,W_{h}} \right)}} \right\rbrack}}} = {{\sum\limits_{h = 1}^{H}{\left\langle \zeta_{h} \right\rangle\left( {{{- \frac{v_{h}}{2}}\ln{W_{h}}} - {\frac{v_{h}D_{t}}{2}\ln\; 2} - {\sum\limits_{i = 1}^{D_{t}}{\ln\;{\Gamma\left( \frac{v_{h} + 1 - i}{2} \right)}}} + {\frac{v_{h} - D_{t} + 1}{2}\left\langle {\ln{L}} \right\rangle}} \right)}} - {\frac{1}{2}{{Trace}\left( {\left\langle L \right\rangle{\sum\limits_{h = 1}^{H}{\left\langle \zeta_{h} \right\rangle W_{h}^{- 1}}}} \right)}} - {\frac{D_{t}\left( {D_{t} - 1} \right)}{4}\ln\;\pi}}},\mspace{20mu}{{- {\sum\limits_{h = 1}^{H}{\left\lbrack {\zeta_{h}\ln\;\eta_{h}} \right\rbrack}}} = {\sum\limits_{h = 1}^{H}{\rho_{h}\ln\;\eta_{h}}}},{{- {\sum\limits_{g = 1}^{G}{\left\lbrack {\gamma_{g}\ln\;{\mathcal{G}\left( {\left. \lambda \middle| a_{g} \right.,b_{g}} \right)}} \right\rbrack}}} = {\sum\limits_{g - 1}^{G}{\left\langle \gamma_{g} \right\rangle\left( {{{- \ln}\;{\Gamma\left( a_{g} \right)}} + {a_{g}\ln\; b_{g}} + {\left( {a_{g} - 1} \right)\left\langle {\ln\;\lambda} \right\rangle} - {b_{g}\left\langle \lambda \right\rangle}} \right)}}},\mspace{20mu}{{- {\sum\limits_{g = 1}^{G}{\left\lbrack {\gamma_{g}\ln\;\theta_{g}} \right\rbrack}}} = {\sum\limits_{g - 1}^{G}{s_{g}\ln\;\theta_{g}}}},{{\left\lbrack {\ln\;{\mathcal{G}\left( {\left. \lambda \middle| \hat{a} \right.,\hat{b}} \right)}} \right\rbrack} = {{{- \ln}\;{\Gamma\left( \hat{a} \right)}} + {\left( {\hat{a} - 1} \right){\psi\left( \hat{a} \right)}} + {\ln\hat{b}} - \hat{a}}},{{\left\lbrack {\ln\;{\mathcal{W}\left( {\left. L \middle| \hat{v} \right.,\hat{W}} \right)}} \right\rbrack} = {{{- \frac{\hat{v}}{2}}\ln{\hat{W}}} - {\frac{D_{t}\hat{v}}{2}\ln\; 2} - {\sum\limits_{i = 1}^{D_{t}}{\ln\;{\Gamma\left( \frac{v + 1 - i}{2} \right)}}} + {\frac{\hat{v} - D_{t} - 1}{2}\left\langle {\ln{L}} \right\rangle} - \frac{D_{t}\hat{v}}{2} - {\frac{D_{t}\left( {D_{t} - 1} \right)}{4}\ln\;\pi}}}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 81} \right\rbrack \end{matrix}$ The control unit 11 executes an information output process on the basis of the thus obtained t0. The information output process will be described later below.

Further, the control unit 11 updates the content of the information output during the actual visual field test for a patient who undergoes the visual field test for the first time. Namely, when the visual field test is performed and a part of the actual test results (visual sensitivity information of a part of the test points) is input through the input/output unit 15, the control unit 11 updates the prior-distribution with reference to the visual sensitivity information of the test points which has already been obtained by the time of inference process. Specifically, the control unit 11 divides the test result vector t into the visual sensitivity information (vector) to indicating the visual sensitivity information of the test points which has not been obtained by time of the process, and visual sensitivity information (vector) tb indicating the visual sensitivity information of the test points which has already been obtained by the time of the process. For convenience, the divided elements are represented as

$\begin{matrix} {t = \begin{pmatrix} t_{a} \\ t_{b} \end{pmatrix}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 62} \right\rbrack \end{matrix}$ (if the order of measurement is predetermined among the test points, the elements of the vector t may be sent in the order of measurement). The corresponding μ and Λ are represented as below.

$\begin{matrix} {{\mu_{k} = \begin{pmatrix} \mu_{k,a} \\ \mu_{k,b} \end{pmatrix}}{\Lambda_{k} = \begin{pmatrix} \Lambda_{k,{aa}} & \Lambda_{k,{ab}} \\ \Lambda_{k,{ba}} & \Lambda_{k,{bb}} \end{pmatrix}}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 82} \right\rbrack \end{matrix}$ Then, the control unit 11 calculates the inference result to of a part of the test points as a partial inference test result vector, using the following equation.

$\begin{matrix} {{{P\left( t_{a} \middle| t_{b} \right)} = {\sum\limits_{k - 1}^{K}{\pi_{k}^{new}{\mathcal{N}\left( {\left. t_{a} \middle| {\mu_{k,a} - {\Lambda_{k,{aa}}^{- 1}{\Lambda_{k,{ab}}\left( {t_{b} - \mu_{k,b}} \right)}}} \right.,\Lambda_{k,{aa}}^{- 1}} \right)}}}}{{wherein},}} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 83} \right\rbrack \\ {{\pi_{k}^{new} \propto {\pi_{k}\sqrt{\frac{\Lambda_{k}}{\Lambda_{k,{aa}}}}\exp\left\{ {{- \frac{1}{2}}\left( {t_{b} - \mu_{k,b}} \right)^{T}\left( {\Lambda_{k,{bb}} - {\Lambda_{k,{ba}}\Lambda_{k,{aa}}^{1}\Lambda_{k,{ab}}}} \right)\left( {t_{b} - \mu_{k,b}} \right)} \right\}{\sum\limits_{k - 1}^{K}\pi_{k}^{new}}}} = 1} & \left\lbrack {{Numerical}\mspace{14mu}{Formula}\mspace{14mu} 84} \right\rbrack \end{matrix}$ Thereby, provided that each of a plurality of unmeasured test points is a noted test point, the inference test result information at the noted test point can be obtained.

The control unit 11 executes an information output process, on the basis of the thus obtained inference result ta(P(ta|tb)). The information output process will be explained below.

[Information Output Process]

The control unit 11 executes an information output process, after obtaining an inference test result vector or a partial inference test result vector, including the inference results of the visual sensitivity at unmeasured test points, as described above. In the information output process, for example, the control unit 11 may display a list including information for specifying respective test points as well as the visual sensitivity inference results of at least a part of the relevant test points (unmeasured test points) included in the inference test result vector or the partial inference test result vector, as they are.

Thereby, a testing personnel can obtain information regarding the luminance which is inferred to be visible for a patient at a predetermined probability, and can select a luminance to be initially presented to the patient at each test point, with reference to the luminance indicated by the information as probably visible. Accordingly, the number of trials to present a luminance which is definitely visible for the patient, can be decreased, resulting in decreasing the number of repetitions at each test point, and reducing the burden of the test for both the testing personnel and the patient.

Further, selecting a test result at a noted test point, the noted test point being one of the unmeasured test points, from the test results included in the inference test result vector or the partial inference test result vector, the control unit 11 may execute the following process. Namely, the control unit 11 calculates a difference between the inference result at the noted test point and the inference result or the measurement result (actual test result) of the visual sensitivity at a test point neighboring to the noted test point, and when the calculated difference exceeds a predetermined threshold value for spatial change, the control unit 11 outputs information for specifying a neighbor space of the noted test point.

As shown in FIG. 2, for example, provided that there are an unmeasured test point Pi,j, and test points Pi−1,j, Pi,j−1, Pi+1,j, Pi,j+1 (usually referred to as 4-neighbor test points) which have been previously set adjacent to the test point Pi, j, and that inferred visual sensitivity values for these test points are V[Pi,j], V[Pi−1,j], V[Pi,j−1], V[Pi+1,j], V[Pi,j+1], respectively, the control unit 11 calculates the difference between the value at the test point Pi,j and each of the values at the 4-neighbor test points, the differences being Δi|1,j=|V[Pi−1,j]−Pi,j|, Δi,j−1=|V[Pi,j−1]−Pi,j|, Δi+1,j=|V[Pi+1,j]−Pi,j|, Δi,j+1=|V[Pi,j+1]−Pi,j| (wherein, |*| refers to an absolute value of *).

When any of the calculated differences exceeds a predetermined threshold value (referred to as spatial change threshold value), the control unit 11 outputs information which specifies a neighbor space of the noted test point Pi,j, to the display unit 14. At this time, the control unit 11 may also display, on the display unit 14, a suggestion to arrange more test points within the specified space. Here, specifically, the neighbor space of the noted test point Pi,j may be the position of the noted test point Pi,j itself. The neighbor space of the noted test point Pi,j may also be a range of space within a predetermined distance r from the noted test point Pi,j, and the like.

Referring to the display, the testing personnel may arrange more test points within the displayed range or around the displayed position, in accordance with need, and perform the measurement at these test points. Thereby, more accurate testing becomes possible.

[Future Inference]

The visual field test assistance apparatus 1 according to the present embodiment may infer the result of a future visual field test, and output the inference result thereof, as described below. In this case, with respect to a designated patient, the control unit 11 receives the results of the tests undergone by the patient in the past. The received test results include the visual sensitivity information of a plurality of time points in the past, regarding each test point.

With respect to each test point, the control unit 11 executes a regression analysis process regarding the change in the visual sensitivity over time indicated by the information acquired as above, to thereby obtain values for an intercept and a slope as well as p values therefor, regarding the change. The control unit 11 counts the number of test points where the p value for the slope is lower than a predetermined analysis threshold value (where the change of test result over time progresses). Also, the control unit 11 executes a one-sided binomial test regarding the counted number of test points, to calculate a result of the binomial test, i.e., a binomial test p value (a probability that the number of test points is not significant). With respect to the number of test points where the progression occurs, the prior ratio of such test points should be obtained in advance.

The control unit 11 sets the analysis threshold value to a plurality of values which are different from each other, and repeats the above process regarding the plurality of analysis threshold values. Here, the analysis threshold values are set to, for example, four values, i.e., 0.025, 0.5, 0.075, and 0.1. The control unit 11 calculates an averaged binomial test p value, by averaging the binomial test p values obtained corresponding to the respective analysis threshold values (specifically, the median of the binomial test p values may be used). When the averaged binomial test p value is lower than a predetermined test threshold value, the control unit 11 determines that the visual sensitivity change over time is significant (the change in the test result (visual sensitivity) progresses over time). Then, the control unit 11 outputs the determination result regarding the presence/absence of the change in the visual sensitivity over time, to the display unit 14.

When the control unit 11 determines the visual sensitivity change over time is present, the control unit 11 displays a position, within the visual field space, of a test point having a p value (p value relating to the slope of the regression analysis result) lower than a predetermined analysis threshold value. Thereby, the location of the test point inferred as having a visual sensitivity change over time is provided. Then, on the basis of the regression analysis result with respect to each test point determined as having a visual sensitivity change over time, the control unit 11 obtains an inference result of the visual field at a designated time point in the future, and outputs the obtained inference result. This process is performed by assigning the regression analysis result and time until the designated time point to a regression formula, with respect to each test point determined as having a visual sensitivity change over time, and obtaining and displaying the visual sensitivity information at each test point.

Accordingly, a portion where progression in visual sensitivity occurs, and a future visual sensitivity at the relevant portion, can be provided. Thus, the testing personnel and the patient can obtain an inference result regarding a visual field test result to be obtained in the future. In this case, for example, a medical staff can specifically point out the future situation while taking the living conditions of the patient into account, resulting in contributing the decision on treatment, etc.

[Operation]

The visual field test assistance apparatus 1 according to the present embodiment has a structure as above, and operates as follows. Namely, the visual field test assistance apparatus 1 performs Bayesian inference using a predetermined mixture distribution for the prior-distribution, and infers a result of a current or future visual field test as a posterior distribution. At this time, parameters relating to the mixture distribution have been obtained in advance, through a learning process using known information, i.e., measurement results of a plurality of occasions (time-series information measured with time intervals), regarding a plurality of patients measured in the past.

At the time of the test, in case of a patient who underwent the test in the past, the visual field test assistance apparatus 1 performs Bayesian inference using information of the patient's past test result and the mixture distribution using the previously obtained parameters, and infers a visual field test result of the current test (information of luminance which is inferred to be visible for a patient at a predetermined probability at each test point). Then, the visual field test assistance apparatus 1 provides the inference result to the testing personnel. The testing personnel refers to the luminance information, and determines a luminance to be initially presented to the patient regarding each unmeasured test point.

During the test, the testing personnel inputs luminance information obtained at each test point through the test, to the visual field test assistance apparatus 1 (or the device used for the test may be set to input the relevant information, without requiring any human-made operations). When the visual field test assistance apparatus 1 receives the luminance information obtained during the test at a test point, the visual field test assistance apparatus 1 updates the prior-distribution using the received information, and infers a visual field test result at an unmeasured test point by Bayesian inference. Then, the visual field test assistance apparatus 1 provides a newly inferred result to the testing personnel. The testing personnel refers to the newly inferred result and determines a luminance which should be initially presented to the patient at the unmeasured test point.

In case of a patient who undergoes the test for the first time, a similar processes are performed by executing inference using a predetermined mixture normal distribution. Thereby, unlike the case where test results are obtained through trials and errors, the testing personnel can set initial conditions on the basis of a test result having a predetermined probability, and thus, test results can be obtained in a comparatively short time.

Modified Example

In the above explanation, the visual field test assistance apparatus 1 calculates a difference between an inference result of visual sensitivity at a test point (noted test point) and an inference result or a measurement result (actual test result) of visual sensitivity at a neighbor test point, and when the calculated difference exceeds a predetermined spatial change threshold value, the visual field test assistance apparatus 1 outputs information specifying a neighbor space of the noted test point. With this respect, the spatial change threshold value does not have to be the same value over the entirety of the visual field space.

For example, it is well known that the test result values of the test points arranged in the upper half of the visual field space are little related to the test result values of the test points arranged in the lower half of the visual field space. With respect to a pair of test points respectively arranged on the upper half and the lower half of the visual field space, the space change threshold value to be used for the comparison with the difference between the pair of test points may be set greater, compared to the space change threshold value to be used for the comparison for the test points located in other part.

Further, in the visual field test assistance apparatus 1 explained above, one set of parameters is used for the Bayesian inference. However, parameters may be divided into a plurality of groups on the basis of race, sex, residence, etc., and parameters may be obtained for respective groups through learning using test results of patients belonging to respective groups.

In this case, the visual field test assistance apparatus 1 infers the test result regarding a patient to be inferred, by selecting parameters obtained through learning on the basis of patient information belonging to a group same as the group to which the relevant patient to be inferred belongs. 

The invention claimed is:
 1. A visual field test assistance apparatus which assists a tester who performs a visual field test of a subject, the apparatus comprising: a processor which acquires parameters of a predetermined mixture distribution used in Bayesian inference, the parameters being learned with reference to visual field test result information obtained through the visual field test in the past, the visual field test result information including information of visual sensitivity information obtained at each of a plurality of test points arranged within a previously assumed visual field range, sets the predetermined mixture distribution with the acquired parameters to a prior-distribution for the Bayesian inference, for the subject who undergoes the visual field test for a first time, sets posterior distribution by using a predetermined mixture normal distribution function, and repeats a step of calculating a Kullback-Leibler divergence of the predetermined mixture normal distribution function and updating the parameters to minimize the Kullback-Leibler divergence, until the Kullback-Leibler divergence converges for the Bayesian inference, obtains the visual sensitivity information at each of the plurality of test points by time of an inference process through an input/output unit during the visual field test, each time the visual sensitivity information at one or more of the plurality of the test points arranged within the previously assumed visual field range is obtained, updates the prior-distribution using the obtained visual sensitivity information, calculates a partial inference test result vector representing a Bayesian inference result of the visual sensitivity information with taking advantage of the prior-distribution and the posterior distribution to be obtained by the visual field test at a test point at which no test result has been obtained at a time of the process of calculating the partial inference test result vector, by the Bayesian inference, and performs an information output process on a basis of the partial inference test result vector obtained by the Bayesian inference, wherein the processor causes an output unit to output a list including information for specifying visual sensitivity inference results of at least a part of the partial inference test result vector which represents inferred visual sensitivity at unmeasured test points.
 2. A visual field test assistance apparatus according to claim 1, wherein, in the information output process on a basis of an inference test result vector obtained by the Bayesian inference, or on the basis of the partial inference test result vector representing the Bayesian inference result of the visual sensitivity information at the test point—at which no test result has been obtained at the time of the process of calculating the partial inference test result vector, the processor calculates information of a luminance inferred to be visible for a patient at a predetermined probability at the test point at which no test result has been obtained, on the basis of the inference test result vector or the partial inference test result vector, and outputs information for specifying the test point at which no test result has been obtained and the calculated information of the luminance to be visible for the patient at the predetermined probability at the test point at which no test result has been obtained.
 3. A visual field test assistance apparatus according to claim 1, wherein, in the information output process on a basis of an inference test result vector obtained by the Bayesian inference, or the information output process on the basis of the partial inference test result vector representing the Bayesian inference result of the visual sensitivity information at the test point at which no test result has been obtained at the time of the process of calculating the partial inference test result vector, the processor calculates a difference between the Bayesian inference result of the visual sensitivity information at the test point at which no test result has been obtained and that of a measurement result of visual sensitivity information at a test point neighboring to the test point at which no test result has been obtained, on the basis of the inference test result vector or the partial inference test result vector, and outputs information for specifying a neighboring space of the test point at which no test result has been obtained when the calculated difference exceeds a predetermined spatial change threshold value.
 4. A visual field test assistance apparatus according to claim 1, wherein the processor acquires visual sensitivity change information over time at each test point, performs a regression analysis process in which the acquired visual sensitivity change information over time at each test point is analyzed, counts a number of test points at which a p value for a slope obtained by the regression analysis process is lower than a predetermined analysis threshold value, sets a plurality of mutually different values as analysis threshold values for an estimation of the acquired visual sensitivity change information over time by the regression analysis process, executes a binomial test using the number of test points relative to the respective analysis threshold values, and calculates binomial test p values as results of the binominal test using the number of test points relative to the respective analysis threshold values, executes an averaging process in which averaging of the calculated binomial test p values corresponding to the respective analysis threshold values is performed, and determines presence/absence of a visual sensitivity change on a basis of whether or not the averaged binomial test p value is lower than a predetermined test threshold value, and outputs a result of a determination of the presence/absence of the visual sensitivity change.
 5. A visual field test assistance apparatus according to claim 4, wherein the processor outputs a visual field inference result by the Bayesian inference at a designated time point in the future on a basis of a spatial arrangement of test points determined to have the visual sensitivity change, and the slope obtained by the regression analysis process. 